[Statement] Bowen content is limited tutorial will be available, if infringement please let me delete, such as not timely reply or unclear please add micro-channel aopon007, if you can specify from CSDN very much hope to share with you through this platform CSDN
20 Spring term "data structure Ⅱ" online job usually 3
Paper Total: 100 Score: 100
a, multiple choice (a total of 20 questions, a total of 100 points)
1. Known binary sequence preorder ABDECF, inorder sequence is DBEAFC, then the subsequent sequence
A.DEBAFC
B.DEFBCA
C.DEBCFA
D.DEBFCA
2. Which of the following is an advantage of the sequential storage structure
A. storage density
B. easy insertion operator
C. Remove operational convenience
D. may conveniently be used to store a variety of logical structure
3. i n the length of the sequence table to insert an element (1≤i≤n + 1) th position, the number of moving elements to
An + I. 1-
Bn-I
Ci of
Di-. 1
4. The following operation of the linear table, the operation does not change the relationship between the structure of the data elements are
A. Insert
B. Delete
C. sort
D. lookup
5. The purpose of the introduction of a binary tree is a clue
A. accelerate look node predecessor or successor speed
B. In order to facilitate the insertion and deletion in the binary tree in
C. In order to be able to easily find the parents
D. results of the binary tree traversal only
6. The quick sort time complexity in the worst case is
AO (n2log2n)
BO (N2)
(Nlog2N) CO.'S
the DO (log2n)
7. required for implementing recursive algorithm within computer auxiliary data structure is
A. stack
B. queue
C. Tree
D. FIG.
8. In a communication weighted graph G, a minimum edge weights must be included in the G
A. minimum spanning tree
depth first spanning tree in B.
C. breadth first spanning tree
D. depth first forest generation
9. result key string (56,23,78,92,88,67,19,34) for 3 increments trip is sorted Hill
A. (19,23,56,34,78, 67,88,92)
B. (23,56,78,66,88,92,19,34)
C. (19,23,34,56,67,78,88,92)
D. (19, 23 , 67,56,34,78,92,88)
10. When a left subtree of the binary tree is empty prior clues sequence, wherein the number of the empty chain domain
A. uncertain
radical B.O
C.1
D.2
11. No known to contain six vertices (v0, v1, v2, v3 , v4, v5) to the adjacent matrix as shown in FIG, starting from the vertex of vertex v0 depth-first traversal access sequence may be obtained as
A ... (V0, v1, v2, V5, V4, v3)
B. (V0, v1, v2, v3, V4, V5)
C. (V0, v1, V5, v2, v3, V4)
D ... (V0, v1 , v4, v5, v2, v3 )
12. The following key sequence, the stack is configured rootlets
A. {84,46,62,41,28,58,15,37}
B. {84,62,58,46,41,37,28, } 15
C. 15,28,46,37,84,41,58,62} {
D. {15,28,46,37,84,58,62,41}
13. The main difference is the queue stack and
A. different logical structure
different storage structures B.
C. different number of operators included in
the different insertions and deletions D. defined positions
14. keyword sequence (5,1,4,3,7,2,8,6) sort quickly, with the first element 5 is divided into a reference result of
A. (1,2,3 , 4,5,6,7,8)
B. (1,4,3,2,5,7,8,6)
C. (2,1,4,3,5,7,8,6)
D . (8,7,6,5,4,3,2,1)
15. The following search algorithm, the average length to find methods not directly related to the number of elements n is
A. Find block
B. sequential search
C. binary search
D. hash lookup
16. If each column of the matrix An × n as a sub-table, as the whole matrix is a generalized table L, i.e., = L ((A11, A21, ..., AN1),
(A12, A22, ..., AN2) , ..., (a1n, a2n, ..., ann)), and may seek request by seeking the header and footer head tail operation
takes each element of the matrix, the calculation is determined a21
A.head (tail ( head (L)))
B.head (head (head (L)))
C.tail (head (tail (L)))
D.head (head (tail (L)))
17. The overflow phenomenon typically occurs
during push operation in sequence of stack A.
B. sequentially stack the stack during operation
during operation of the stack in the link stack C.
Process D. The link stack pop operation
18. The binary tree height is h, or for all nodes is 0, or 2, the binary tree has a minimum number of nodes
A.2h
B.2h. 1-
C.2h +. 1
D.H. +. 1
19. The following sorting algorithm, the time complexity not affect data in the initial state, the constant is 0 (nlog2n) is
A. heap sort
B. Bubble sort
C. Direct Selection Sort
D. Quick Sort
20. 1 of the binary tree starting numbered consecutively, each node number requires approximately greater than the number of children, a child of about the same node, which is smaller than the number of left children and right children of numbers may be employed to traverse way is
A. preorder
B. inorder
C. subsequent
D. traverse the level starting from the root
