data structure 期中复习答案.doc

第  PAGE 4 页 共  NUMPAGES 4 页 第  PAGE 3 页 共  NUMPAGES 4 页 Midterm data structure review 1．Concepts explaining Data structure Time complexity Array implementation of list Linked list Queue Stack Binary tree Algorithm Depth of a tree (10)Height of a tree 2．Single choice (1) Which data structure is first in last out for data storage? ( B ) A. Queue B. Stack C. Character string D. Simple linear list (2) Which is dequeue time complexity in a queue as follows? ( A ) A. O(1) B. O(log2n) C. O(n) D. O(n2) (3) If a pushing sequence of a stack is 1,2,3…,100, and the output sequence is p1,p2,p3, …,pn and if p1=100, what p20 is then? ( C ) A. 40 B. 60 C. 81 D. uncertain (4) Which are the normal two storage structures of stack structure? ( A ) A Sequence storage structure and linked storage structure B Hash mode and index mode C Linked list storage structure and array D linear storage structure and nonlinear storage structure (5) The memory address of first element of a sequence queue is 200, the memory address of the second element is 204 and the length of every element is 4, what is the address of 6th element? ( B ) A.210 B. 220 C. 200 D. 230 (6) What is the condition to judge if a stack S (m elements at best) is empty? ( A ) A. S.top= =0 B. S.top= =-1 C. S.top!=m D. S.top= =m (7) What is the sameness between queue and stack? ( C ) A. First in first out all B. First in last out all C. Insertion and deletion only be done at the terminals D. No sameness at all (8) In a singly linked list, a given node by a pointer q pointing is a successor(后继) of the node that is pointed by p pointer, if inserting a node s into p and q, then ( D )need to be accomplished. A. s-next=q; p-next=s; B. p-next=s-next; s-next=p; C. q-next=s-next; s-next=p; D. p-next=s; s-next=q; (9) In a singly linked list, if a node that is a success