数据结构练习题26(国外英语资料).docVIP

数据结构练习题26(国外英语资料) To be sensitive, to learn, to ask -- Confucius Practice problems with data structures The first section (30 points) One, the single item choice (each item 15 item in this topic, two points, a total of 30 points) in the four choices of each item listed is only one option is to meet the requirements of the title, please fill out the letter of the correct options before in parentheses after the question The algorithm refers to () A. computer program b. solve the problem C. sorting algorithm d. solving the problems finite operation sequence The storage address of the node () when the linear table is stored in a chain store. A. it must be discontinuous B. Its continuous or not It must be continuous The storage address of the head node is continuous The time complexity of the algorithm () that links the single-linked list of length n to the single linked list of length m is (). A.o. (n) (m) D.O (m + n) The benefit of sharing a vector space with two stacks is () A. reduce access time and reduce the chance of occurrence B. save storage space and reduce the probability of overflows C. reduce access time and reduce the probability of overflows D. save storage space and reduce the chance of overflow Set the array data [m] as the storage space for the loop queue SQ, front for the team header, rear for the team tail pointer, and the first pointer front value () after the team operation. A.f ront = front + 1 B.f ront = (front + 1) % (m - 1) The C.f ront = (front + 1) % m What is correct in the presentation is () A string is A special linear form B. The length of A string must be greater than zero The element in a string is only the d. the empty string is a blank string 7. If the target is n the length of the string, the length of the pattern string for [3] n /, performing pattern matching algorithm, in the worst case time complexity is () A.O () B.O (n) C.O (n2) D.O (n3) The head of a non-empty generalized table () A. it cant be A child table B. It can only be A