数据结构样卷3(英文).docVIP

重庆大学 《数据结构》 课程样卷3  开课学院： 计算机学院 课程号： 考试日期： 考试时间： 120 分钟 题 号 一 二 三 四 五 六 七 八 九 十 总 分 得 分 Single choice Merge two ordered list, both of them contain n elements, the least times of comparison is ( ). A. n B. 2n-1 C. 2n D. n-1 Sequential stored linear list with the length of 1000, if we insert an element into any position, the possibility is equal, when we insert a new element, the average number of removing elements is ( ). A. 1000 B. 1001 C. 500 D. 499 Assume that the initial status of stack S and queue Q are both NULL, push elements e1,e2,e3,e4,e5,e6 into the stack S one by one, an element pops from stack, then enter into queue Q. If the sequence which the six elements in the dequeue is e2,e4,e6,e5,e3,e1, the capacity of stack S is at least ( ). A. 6 B. 4 C. 3 D. 2 Two-dimensional array A [10 .. 20,5 .. 10] stores in line sequence, each element occupies 4 storage location, and the memory address of A[10,5] is 1000, then the address of A[20,9] is ( ). A. 1212 B. 1256 C. 1368 D. 1364 A tree with degree 3, it has 2 nodes with the degree 3, one node with the degree 2, and 2 nodes with the degree 1, so the number of nodes with degree 0 is ( ). A. 4. B. 5. C. 6. D. 7 The inorder sequence of a binary tree is ABCDEFG, and its postorder sequence is BDCAFGE, so its pre-order sequence is ( ) A. EGFACDB B. EACBDGF C. EAGCFBD D. EGAFCDB A Huffman tree with n leaf nodes, its total number of nodes is ( ) A. n-1 B. n+1 C. 2n-1 D. 2n+1 In an adjacency list of undirected graph with n vertexes and e edges, the number of edge node is ( ). A. n B. ne C. e D. 2e The degree (sum of in-degree and out-degree) of a directed graph is k1, and the number of out-degree is k2. Therefore, in its adjacency list, the number of edge nodes in this singly linked list is ( ). A. k1 B. k2 C.