[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 1
Paper Total: 100 Score: 100
a, multiple choice (a total of 20 questions, a total of 100 points)
1. Suitable batch processing file type is
A. sequential file
B The index sequential file
C. hash file
D. multi-keyword file
2. directed acyclic graph described expression (A + B) * (( A + B) / A), at least for the number of vertices needed
A.5
B.6
C.8
D.9
3. If the insert key 9 in order to cause the nodes B- tree split, the number of keywords contained in the node is inserted before
A.4
B.5
C.8
D.9
4. Suppose a complete binary tree traversal order hierarchy are sequentially stored in an array BT [m] in which the root node is stored in the BT [0], if the node BT [i] have the left child, the left child storage in
A.BT [I / 2]
B.BT [2 I-. 1]
C.BT [2 I]
D.BT [I + 2 *. 1]
5. The following statement is correct
A. binary tree is an ordered tree of 2
B. binary tree node has only one child left without points
C. binary tree must have a degree of node 2
D. binary tree Up only two sub-tree, and left and right points
6 has a sequence of stack, 6 elements 1,2, 3,4, 5,6 sequentially stack, the stack if the element 6 is 2,3,4,6,5,1 sequence, the stack capacity should be at least
A.2
B.3
C.5
D.6
7. The ordered list of n elements each have two merged into a sorted list which is a minimum number of comparisons
An
B.2n. 1-
C.2n
Dn. 1-
8. stacks and queues are
linear structures limit access to location A.
B. linear structure storage order
linear chain structure stored C.
nonlinear structure to restrict access to position D.
9. The triple table is a table with rows of the sparse matrix
A. sequential storage structure
B. Storage Structure
C. index storage structure
D. hash storage structure
10. If the linear table of length n sequential storage structure, a time complexity of the new element is inserted in its i th position algorithm is
AO (0)
BO (. 1)
CO.'S (n)
the DO (N2)
11. The following statement is false
(1) Meaning algorithm means situ work without any additional auxiliary space
(2) at the same size n, complexity of O (n) time algorithm is always better complexity of O (2n) algorithm
(3) a so-called time complexity refers to a worst-case execution time of an upper bound estimate algorithm
(4) the same algorithm, the higher level language, the lower the efficiency
a . (. 1)
B. (. 1), (2)
C. (. 1), (. 4)
D. (. 3)
12. The following is a logical structure that
A. order table
B. hash table
C. Table ordered
D. single chain
13.ALV tree is a balanced binary sort tree, the tree to any one node
A. The left, right subtree height are the same
B. left and right sub-tree does not exceed the absolute value of the difference in height. 1
C. Left subtree height greater than the height of the right subtree
height D. left subtree is less than the height of the right subtree
Two common memory stack 14. The structure respectively
A. sequential storage structure and Storage Structure
B. sequential storage structure and the storage structure hash
C. Storage Structure and index storage structure
D. Storage Structure and hashing storage structure
15. In FIG employed adjacent table storage, the minimum spanning tree algorithm seeking Prim time complexity of
AO (n-)
BO (n-+ E)
CO.'S (N2)
the DO (N3)
16. When a fast lookup points, how the data is organized
A. data into a plurality of blocks, each block in the data ordered
B. Data divided into blocks, each block in the data need not ordered, but must be ordered inter blocks, each the maximum (or minimum) index of the block data within blocks
C. data into a plurality of blocks, each ordered in the data, the maximum (or minimum) blocks of data in each index block
D. data divided into blocks, each block (except Finally, an outside) in the same number of data required
17. The main advantage of the inverted file is
A. facilitate insertion and deletion operations
B. facilitate recovery file
C. facilitate multi-keyword query
D. save storage space
18. Force caused by the circular queue head position change operation is
A. dequeue
B. enqueuing
C. Take the head elements
D. take the tail element
19. The description below with respect to the linear table, the error is
A. Table linear sequential storage, it must occupy a contiguous memory locations.
B. Linear sequential table stored facilitate insertion and deletion operations.
C. using a linear link table stored without taking up a contiguous memory locations.
D. using linear link table storage, easy to insert and delete operations.
20. The results in the target string T [0 ... n-1] = "xwxxyxy", to the pattern string P [0 ... m-1] = "xy" substring for positioning operation is
A.1
B.2
C. 3
D.5
