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

《数据结构》6977（Data structure, 6977） 15, everything is the most generous spirit of great - Erwin Volume B Data structure ID name ________ __________ fraction __________ Question no. One Two Three Four Five Six The total score Fraction A RadioButtonList (every day, 1 points, 10 points) 1. the data form is independent of the form, content, relative position, number of data elements themselves A. storage structure, B. logic structure, C. algorithm, D. operation Compared to the sequential stack, the 2. chain stack has one obvious advantage The A. insertion operation is more convenient and B. usually does not appear full C. does not appear empty stack, D. delete operation is more convenient 3. divide the sequence of sorted elements into two left and right sub sequences, and then apply the same sort operations to the two sub sequences until the subsequence is empty or has only one element left This sort of sorting method is () A. direct selection sort, B. direct insertion sort, C. quick sort, D. bubble sort 4. if the adjacency matrix is used to store an undirected graph of n vertices, then the adjacency matrix is a () A. three solutions matrix, B. sparse matrix, C. diagonal matrix, D. symmetric matrix 5. in a cyclic queue stored sequentially, the head of the team refers to the element of the header element A. the last position, B., the latter position, the C. team, the head element position, the D. position, the last element of the tail element 6. the advantage of using a linked list to represent linear tables is () A. facilitates random access, and B. spends less storage space than sequential tables C. facilitates insertion and deletion of D. data elements with the same physical order as in logical order 7. direct insertion of 5 different data elements, most of which need to be (or) compare A.8 B.10 C.15 D.25 8. in the following storage form, () is not the storage form of the tree A. parent notation, B., left child, female, right brother, notation, C., generalized table repr