河南电大数据结构期末复习题(历年考试题).docVIP

河南电大数据结构期末复习题3(历年考试题) 1. output a two-dimensional array, the time complexity of all elements in b[m][n] (D). A. (), B. () (m, ten, n), C. () (N2), D. () (m*n), (n) 2. when the search value is x in an ordered table stored in the order of N in length, the time complexity of the most efficient algorithm is (C). A. () (B.), (), C. () (), D. () (n) 3. when storing a stack in the order of an array of size n, assuming that the stack space is represented by top= =n, you should first execute the (B) statement to modify the top pointer when inserting an element into the stack. A.top++; B. top--; C.top=0; D.top; 4. in a tree, (C) there is no precursor node. A. tree node, B. leaf node, C. root node, D. empty node 5. it is known that the edge set of a tree is represented as {A, B, A, C), B, D, C, E, C, F, C, G,, F, H, F, I}, then the tree is depth (B). Suppose the root node has a depth of 0. A. 2, B. 3, C.4 D.5 The connected graph of 6.n vertices contains at least (A) edges. A.n 1, 1 B.n, C.n (n-1) / 2, D., n (n, 1) 7. the number of vertices of the undirected graph is n., then the graph has at most (B) edges. A.n one, 1, B.n (n, 1) / 2, C.n (n+1) / 2 D.n (n, 1) 8. when using open hashing to resolve conflicts, the values of each table item (C) are the same in each of the synonymous sub tables linked by each hash address. A. key B., non key code, C. hash function, D., a domain The 9. hash function should have such a property that the letter value should take every value of its range within (D) probability. A. Max B. minimum C. average D. equal Two. Fill in the blanks 1. object oriented features should include objects, classes, inheritance, polymorphism, messaging, communications, and so on. 2., in the single linked list to set the header, the role of additional nodes is to insert and delete any element in the table when the operation is the same 3. if the maximum capacity of the sequential stack is MaxSize, and the top==-l represents the stack space, the condition of the stack is