做在答题纸上,在试题纸上做解答按零分处理。数据结构的43（Make it on the answer sheet, answer on the test paper, and divide it by zero. Data structure 43）.docVIP

做在答题纸上,在试题纸上做解答按零分处理。数据结构的43（Make it on the answer sheet, answer on the test paper, and divide it by zero. Data structure 43） 2, Efficiency comes from diligence., shortage in the play; line into Si, destroyed with Han Yu Please put all the answers on the answer sheet, answer them on the test paper, and divide them by zero The data structure algorithm questions can be described using the style of C or C++ language A single choice. (the title of 10 items, each item of 2 points, a total of 20 points) Write the answer option and the title number on the answer sheet, and choose the wrong or not 1., the length of n single linked list connected to the length of m single chain table after the algorithm, the time complexity is () A., O (n), B., O (1) C., O (m), D., O (M + n) 2. set the array data[, M] as the storage space of the cyclic queue SQ, the front is the header pointer of the team, and the rear is the tail pointer of the queue, and then the value of the head pointer front is () after the operation of the team A., front = front + 1, B., front = (front + 1)% (M - 1) C., front = (front - 1)%, m D., front = (front + 1)% m 3. the head of a nonempty generalized table () A. cannot be a child table; B. can only be sub tables C. can only be atomic D. and can be atoms or sub tables The time complexity of the 4. heap sorting in the worst case is () A., O (log2, n), B., O (log2, N2) C., O (nlog2, n), D., O (N2) 5. let G1 = (V1, E1) and G2 = (V2, E2) be two graphs, if V1, V2, E1, E2, then call () A. G1 is the subgraph of G2, and B. G2 is the subgraph of G1 C. G1 is the connected component of D., and G2 G2 is the connected component of G1 6. in a tree with a degree of 3, the number of nodes is 2, the number of nodes is 2, the number of nodes is 1, and the number of nodes is 0 (3) A. 4, B. 5, C. 6, D. 7 7. a directed graph with n vertices and e arcs is represented by an adjacency table, and the time complexity of all arcs associated with a vertex VI is removed A., O (n), B., O (E),