《数据结构》7044（Data structure 7044）.docVIP

《数据结构》7044（Data structure 7044） Business is better than diligence - han yu B Data structure The number __________ __________ qid a The second three four five six Total score score 1. Single topic (1 point, 10 points) 1. The form, content, relative position and number of the data elements themselves are irrelevant to the data (). A. storage structure b. logical structure c. algorithm d. operation 2. Compared with the sequential stack, a more obvious advantage is () A. Insert operation is more convenient. There is usually no stack C. No case of stack is available. D. Delete operation is more convenient 3. Treatment of sorting sequence of elements, it can be divided into left and right two subsequence, again to two subsequence exert the same sort operations, until the sequence is empty or only one element The way to sort it is () A. Direct selection sort B. Direct insertion sort C. Quick sort D. Bubble sort 4. If an undirected graph of n vertices is stored by adjacency matrix method, the adjacency matrix is one (). A. Upper trisolution matrix B. Sparse matrix C. Diagonal matrix D. Symmetric matrix 5. In a sequential storage loop queue, the header pointer points to the team header element () A. The position of the head element of the team 6. The advantage of using a list to represent a linear table is () A. Easy access to B. The storage space is less than the sequence table C. Easy to insert and delete D. The physical order of data elements is the same as the logical order Direct insertion sort for five different data elements requires maximum () time comparisons A. b. 8 10 C. 15 D. 25 In the following form of storage, () is not a storage form of a tree A. parental representation b. left child right brother representation c. generalized table notation d. sequential representation 9. The total number of nodes in a two-tree with five layers is (). A. 31 b. c. 32 33 D. 16 10. With 100 data elements, the maximum comparison frequency is () when the semi-search is adopted. A.