### Can anyone tell me where to download this from! Higher education self-study exam computer network and communication questions and answers?

I am a computer network major

Beijing Self-study Examination in Computer Networking (Independent Undergraduate)

Course Code Course Name Credits Non-written Course Code Non-written Course Name Non-written Course Credits Remarks

00004 Introduction to Mao Zedong Thought 2

00005 Principles of Marxist Political Economy 3

00015English (II) 14

00023Advanced Mathematics (IIT) 10

00420Physics (IIT) 500421Physics (IIT) (Lab) 1

02194Engineering Economics 4

02314Analog and Digital Circuits 602315Analog and Digital Circuits (Lab) 2 Additional Courses

02142Introduction to Data Structures4

02319Microcomputers and Their Interface Technologies202320Microcomputers and Their Interface Technologies (Lab)2

02384Principles of Computing4

02335Network Operating Systems5

02354Signals and Systems402355Signals and Systems (Lab)1

02364Principles of Data Communication5

02379Computer Network Management3

03137Fundamental Principles of Computer Networks703138Fundamental Principles of Computer Networks Lab1

03139Database Technology403140Database Technology (Lab)1

03141 Local Area Network Technology and Networking Engineering5

03142 Internet and Its Applications403143 Internet and Its Applications (Experiment)1

10032 Graduation Design (Thesis) of Computer Networking 0

It seems that there is not a network engineering major that you are talking about, is it a communication engineering major?

(01B0809) Computer Communication Engineering (Independent Undergraduate)

Course Code Course Name Credits Non-written Course Code Non-written Course Name Non-written Course Credits Remarks

00004 Introduction to Mao Zedong Thought 2

00005 Principles of Marxist Political Economy 3

00015 English ( II)14

00023 Advanced Mathematics (IIT)10

00420 Physics (IIT)500421 Physics (IIT) (Lab)1

02197 Probability and Mathematical Statistics (II)3

02199 Functions of Complex Variables and Integral Transforms3

02326 Operating Systems402327 Operating Systems (Lab) 1

02331 Data Structures 302332 Data Structures (Lab) 1

02336 Principles of Databases 402337 Principles of Databases (Lab) 1

02338 Principles of Fiber Optic Communications 4

02342 Nonlinear Electronic Circuits 302343 Nonlinear Electronic Circuits (Lab) 1 Additional Courses

02361 Fundamentals of Communication Technology 4

02354 Signals and Systems 402355 Signals and Systems (Lab) 1

02360 Principles of Digital Communication 4

02368 Communication English 4

02369 Computer Communication Interface Technology 302370 Computer Communication Interface Technology (Upper Computer )1

02372Program-controlled switching and broadband switching5

02373Computer communication network402374Computer communication network (on-line)1

02364Principles of data communication5

10029Graduation design of computer communication engineering0

But if you choose to self-study college entrance exams, the choice of science and engineering subjects is not very easy, liberal arts is relatively easy, related majors can see www.BJZIKAO.COM这个网站. Good luck!

### Answers to Introductory Data Structures Test Questions for October 06 Self-study Examination

National Self-study Examination for Higher Education in October 2006

Introduction to Data Structures Test Questions

Course Code: 02142

I.Single Choice Questions (There are 15 sub-questions in this question, each sub-question is of 2 marks, in total 30 marks)

Only one out of the four alternative options listed in each question meets the requirements of the question. Only one of them meets the requirements of the question, please fill in its code in the brackets after the question. No marks will be awarded for wrong choice, multiple choice or no choice.

1. The basic unit of data is ()

A. Data item B. Data type

C. Data element D. Data variable

2. The time complexity of the following program is ()

i=0; s=0;

while (s<n)

{i++;

< p>s=s+i;

}

A.O() B.O()

C.O(n) D.O(n2)

3. If the most common operations in a linear table are inserting an element after the last element and deleting the first element, the most computationally time efficient way of storing the table is ()

A. Single linked list B. Single circular chained table with head pointer only A.Single linked table with head pointer onlyB.Single linked table with head pointer only

C.Double linked tableD.Single linked table with tail pointer only

4.When deleting the ith element (1 ≤ i ≤ n) from a sequential table of length n, the number of elements to be moved forward is ()

A.n-iB.n-i+1

C.n-i-1D.i

5. . sequential stack S in top is the top of the stack pointer, pointing to the location of the top element of the stack, elem is the array that holds the stack, then the main statement of the element e into the stack operation is ()

A.s.elem [top]=e; B.s.elem [top+1]=e;

s.top=s.top+1; s.top=s.top+1 ;

C.s.top=s.top+1; D.s.top=s.top+1;

s.elem[top+1]=e; s.elem[top]=e;

6. In the cyclic queue sq, the data elements are stored in the array elem [0– 25] to store the data elements, sq.front indicates the previous position of the element at the head of the queue, sq.rear indicates the current position of the element at the end of the queue, and let the current sq.front be 20 and sq.rear be 12, then the number of elements in the current queue is ()

A.8B.16

C.17D.18

7. There is A symmetric matrix A of order 10, using compressed storage in row order as the main order of storage, a00 is the first element, whose storage address is 0, and each element occupies 1 storage address space, then the address of a45 is ()

A.13B.35

C.17D.36

8. A binary tree containing 10 nodes with a degree of 0 has 4, then the degree of 2 is 0. The number of nodes of degree 2 is ()

A.3B.4

C.5D.6

9. A complete binary tree with 100 nodes is numbered hierarchically, so that the number of nodes numbered 49, its parent node is numbered ()

A.24B.25

C.98D.99

10.A binary tree that can be uniquely transformed into a general tree is characterized by ()

A.root node has no left childB.root node has no right child

C.root node has two childrenD.root node has no children

11.The number of arcs of a directed complete graph with n nodes is ()

A.n2B.2n

C.n( n-1)D.2n(n+1)

12.Let the adjacency chain table of a graph be as shown in the figure of question 12, then the number of edges of the graph is ()

Figure of question 12

A.4B.5

C.10D.20

13.It is known that an ordered table of the form (13, 18, 24, 35, 47. 50, 62, 83, 90, 115, 134), when dichotomized to retrieve elements with a value of 90, the number of comparisons required for a successful retrieval is ()

A.1B.2

C.3D.4

14. A sorting algorithm in which neither element can be determined to be in its final position after the first trip of the sorting algorithm is ()

A. Selection sorting B.Quick sort

C.Bubble sort D.Insertion sort

15.The sorting algorithm that is unstable is ()

A.Direct insertion sort B.Bubble sort

C.Heap sort D.Subsumption sort

II.Fill-in-the-blanks (13 subquestions, 2 points per subquestion, 26 points total)

Please Fill in the blanks of each sub-question with the correct answer. No marks for wrong filling or not filling.

16.In data structures, the logical structure of data is categorized into four types such as sets, ________, tree structures and graphical structures.

17.The quality of an algorithm (including a program) is usually evaluated in four ways: correctness, readability, ________ and efficiency.

18.Sequential tables have a storage density of ________ while chained tables have a storage density of ________.

19.For stacks only elements can be inserted and deleted at ________.

20. In a circular queue, the storage space is 0 to n-1, set the head pointer front to point to a free element before the head element, the tail pointer to point to the tail element, then the team is full of flags for the front = (rear +1)%n, the team is empty of flags for ________.

21.Three nodes can form ________ different forms of binary trees.

22.For a binary tree with n nodes, the total number of pointer fields in its binary linked table when linked storage is performed is 2n, of which ________ are used to link child nodes.

23.A directed graph G is stored with an adjacency matrix A [1–n, 1–n] whose sum of all elements in column i is equal to the ________ of vertex Vi.

24.A ________ traversal of a binary sorted tree yields a sequence of sorted incremental nodes.

25.The sequence of data to be searched using the fold-and-half search method should be ________ and ________.

26.The index file can only be ________ because the index file is organized for random access.

27. In insertion and selection sorting, ________ is used if the initial data is essentially positively ordered, and ________ is used if the initial data is essentially inversely ordered.

28.The best-case time complexity of fast sort is ________ and the worst-case time complexity is ________.

Three, application questions (this question has 5 subtopics, each subtopic 6 points, a total of 30 points)

29.A binary tree is known to have a middle root sequence and a back root sequence of B, D, C, E, A, F, H, G and D, E, C, B, H, G, F, A respectively, try to draw the binary tree, and give its first root sequence.

30.It is known to find the minimum spanning tree starting from vertex A using the prim (prim) algorithm as shown in the figure of question 30. At the beginning of the execution of the algorithm, the set of vertices U = {A, B} and the set of edges TE = {(A, B)}. Try to follow the process of generating the minimum spanning tree and give the values of the sets U and TE after adding the vertices and edges step by step.

31. Given a hash function H(key)=keymod11, and given a sequence of keys 13, 41, 15, 44, 6, 68, 17, 26, 39, 46, try to draw the corresponding open hash table and compute the average length of the lookup when the lookup succeeds with equal probability.

32. Starting from an empty binary sort tree, insert the keywords 25, 13, 15, 34, 7, 20, 37 in turn, and try to draw the binary sort tree after each insertion of the keywords respectively.

33.Draw the initial heap corresponding to the sequence {10, 20, 7, 75, 41, 67, 3, 9, 30, 45} (the top element of the heap is taken to be the smallest).

Four, algorithm design questions (this question has 2 subtopics, each subtopic 7 points, a total of 14 points)

34. In the following bubbling sort algorithm at (1) to (4) fill in the appropriate content, in order to make the algorithm can be stopped in time when found in order.

bubble(R)

RectypeR[n];

{inti, j, exchang;

Rectypetemp;

i=1;

do

{exchang=False;

for ( j=n; j>=(1) ________; j–)

if (R[j] <R[j-1]

{temp=R[j-1];

R[j-1]=R[j];

R[j]=temp;

exchang=(2) ________;

}

(3) ________;

}

while (exchang=(4) ________);

}

35.The following function is an algorithm for removing an edge in an adjacency table of an undirected graph, please (1) to (4) Complete it by filling in the appropriate contents.

Voiddeledge(ALGraph*G, inti, intj)

{EdgeNode*p, *q;

p=G→adjlist [i].firstedge;

if (p→adjvex==j){G→adjlist [i]. firstedge=p→next; free(p);}

else{while (p→next→adjvex!=j&&p→next)

(1) ________;

if (p→next!=NULL){q=p→next; ( (2) ________; free(q); }

}

p=G→adjlist [j].firstedge;

if (p→adjvex==i){G→adlist [j].firstedge=p→next; free(q); }

else{while (p→next→adjvex!=i&&p→next)

(3)________;

if (p→next!=NULL){q=p→next; (4)________; free(q); }

}

< p>Answer ——— ——-___

1C2C3D4A5D6C7, A8, C9, B10D

1, linear 2, sequential, chained 3, robust 4, equal to 1, less than 1

5, n/26, top-of-stack, FIFO , FIFO

7, (i*n+j)*5,(j*m+i)*58, 5 kinds of 9, log2(n)+1

10,

If a complete binary tree has 1450 nodes, the number of nodes of degree 1 is 1, the number of nodes of degree 2

is 724, the number of leaf nodes is 725, and there are 725 nodes

with left children, and 724 nodes with right children; the height of the tree is 11. (Properties

3, 4, and the characteristics of a complete binary tree)

Application 1: typedefstructnode

{

elementypedata;

structnode*pri,*next;

}lnode,*linklist;

Application question 2:

q->next=p->next;

p->next->pri=q;

p-> next=q;

q->pri=p;

34, ABCDEFGH

35, WPl=(3+6+7+9)*3+(10+11)*2=117

10:0111:10

3:0006:0017:1109:111