西交《数据结构》在线作业（国外英文资料）.docVIP

西交《数据结构》在线作业（国外英文资料） Data structure online assignments Exam time: 100 test time: Single topic selection Multiple choice (40 questions, 80 points.) The number of vertices in the undirected graph is n, which is at most (). A. n - 1 N minus 1 over 2 N plus 1 over 2 D. 0 Full marks: 2 In order to store linear tables, the time complexity of the access node and the addition and delete nodes is (). O (n) O (n) O (n) O (1) (1) O (n) O (1) O (1) Full marks: 2 It is known that the string S = aaab, whose Next array value is (). 0123 A. 1123 B. 1231 C. 1211 D. Full marks: 2 The length and depth of L = ((a, b, c)). 1 and 1 A. B. 1 and 3 C. 1 and 2 D. 2 and 3 Full marks: 2 The arithmetic expression a + b * (c + d/e) to the postfix expression is (). A. ab + cde / * B: abcde / + C. abcde / * + D. abcde * / + Full marks: 2 The head of a generalized table ((a, b, c, d)) is (), and the tail is (). A. a. B. () (a, b, C, d) (b, c, D) Full marks: 2 If a binary tree has 10 nodes with 10 degrees, and 5 nodes with 1, the number of nodes with 0 degrees is (). 9 A. 11 B. 15 C. D. not sure Full marks: 2 The expression a * (b + c) -d is (). A. the abcd * + - B. the ABC + * d - C. the ABC * + d - D. - + * abcd Full marks: 2 The traversal of () still requires the support of the stack. A. The tree of the preceding sequence The middle sequence clue tree C. postsequence cue tree D. not sure Full marks: 2 In the following sorting algorithm, the most important space for auxiliary space is () Merge sort Quick sort Hill sort D. the heap sort Full marks: 2 If the binary tree USES a binary linked list storage structure, the location of the left and right subtrees of all the branches of the tree is exchanged, and the method is most suitable for the use of (). A. before order B. in order C. after order D. according to the level Full marks: 2 The time complexity of the algorithm depends on () The size of the problem The initial state of the data C. A and B D. Full marks: 2 The next thing about the algorithm