20 East Spring semester "Data Structure Ⅱ" Online usually work 2

[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 2
Paper Total: 100 Score: 100
a, multiple choice (a total of 20 questions, a total of 100 points)
1. Insert ordered single chain having n nodes in and a new node is still ordered list of time complexity is
AO (. 1)
BO (n-)
CO.'s (nlogn)
the DO (N2)

2. The following program segment for (i = 1; i < = n; i ++) A [I, j] = 0; the time complexity is
AO (. 1)
BO (0)
CO.'S (. 1 + n-)
the DO (n-)

3. can effectively improve the efficiency of times a keyword search file is
A. sequential file
B. inverted file
C. hash file
D.VSAM file

4.for(i=0;i<m;i++)
for(j=0;j<t;j++)
c[i][j]=0;
for(i=0;i<m;i++)
for(j=0;j<t;j++)
for(k=0;k<n;k++)
c[i][j]=c[i][j]+a[i][k]*b[k][j];
上列程序的时间复杂度为
A.O(m+n×t)
B.O(m+n+t)
C.O(m×n×t)
D.O(m×t+n)

5. In the preamble sequence and the following sequence of any sequence in a binary tree, the relationship between the relative order of the leaf
A. necessarily identical
B. same
C. not identical
D. mutually reverse

6. Tree Traversal and after the prior preorder traversal, the tree can be converted to the corresponding binary tree. The following statement is correct
after the root of the preorder traversal of a binary tree corresponding thereto A. same tree traversal
of the root after the root of the tree traversal B. corresponding binary tree traversal same
C. traversing the tree to the root of the binary tree corresponding thereto root traverse the same
D. none of the above

7. The required data elements having the same logical structure having the same properties, meaning it
has the same characteristics of the data element A.
B. only the same number of data items comprising data elements, and the type of the corresponding data item to be consistent
C each data element as
the same data items D. need only contain the number of data elements

8. When a new node is inserted into the binary sort tree, the keyword does not exist if the node to be inserted in the same node in the tree, and the new keyword the keyword is less than the root node, then the new node will become
A. left sub-tree leaf node
branch node the left subtree B.
leaf node C. right sub-tree
branch nodes right subtree D.

9. The following data structures for the proper argument is
A. a type of data
stored in the data structure B.
the same set of data elements C. a set of properties of
the presence of one or more specific relationship between each data element D. set

File 10. In the following various documents can not be sequential search is
A. sequential file
B. index file
C. hash file
D. Multiple table file

Are known to FIG 11. G = (V, E), where V = {V1, V2, V3 , V4, V5, V6, V7}, E = {<V1, V2>, <V1, V3>, < V1, V4>, <V2, V5>, <V3, V5>, <V3, V6>, <V4, V6>, <V5, V7>, <V6, V7>}, G sequence topology is
A.V1 , V3, V4, V6, V2, V5, V7
B.V1, V3, V2, V6, V4, V5, V7
C.V1, V3, V4, V5, V2, V6, V7
D.V1, V2, V5, V3, V4, V6, V7

12. In the hierarchical binary tree traversal algorithm, it is required by the auxiliary data structure
A. queue
B. stack
C. linear table
D. Table orderly

Sequence and the first order 13 of a subsequent sequence of the opposite binary tree, the binary tree must be characteristic
A. empty or only a node
B. height equal to the number of nodes
C. without any a left child node
D. any one of no right child node

14. The storage space is known as a hash table T [0 ... 18], the hash function H (key) = key% 17 , and conflict with the second detection method. Hashtable inserted the following keywords: T [5] = 39, T [6] = 57 and T [7] = 7, then the next key insertion position 23
the AT [2]
the BT [. 4]
CT [ . 8]
DT [10]

15. The length of the binary search for the ordered sequence of Table 15, in the case where the probability of finding each record are equal, the search key is performed when the required number of times an average value of a successful comparison
A.39 / 15
B.49 / 15
. 51 s / 15
D.55 / 15

16. recursive algorithm implemented in a computer assisted data structure is required
A. stack
B. queue
C. Tree
D. FIG.

17. The principle of the sorting process based on classification belonging quick sort
sorted class A. Insert
B. Select sort method class
sorting methods class C. exchange
sorted merge class D.

18. The sequence of storage design, the address of the memory cell
A. certain continuous
B. An discontinuous
C. necessarily continuous
D. continuous portion, the discontinuous portion

19. From the data structure can be logically divided into two categories, i.e.,
A. dynamic structures, the static structure
B. sequential structure, chain structure
C. linear, nonlinear structure
D. elementary structure, the structural arrangement

20. In a single linked list, if the node is deleted * p successor node, the operation is performed
Aq obtained p-=> Next; p-> = Q- Next> Next; Free (Q);
Bp = p-> Next ; p-> Next = p-> next-> Next; free§;
Cp-> = Q- Next> Next; Free (p-> Next);
Dp = p-> next-> Next; Free (p-> next);

Published 15 original articles · won praise 0 · Views 59

Guess you like

Origin blog.csdn.net/aopenfang/article/details/105163745