数据结构判断题Datastructurejudgement.doc

数据结构判断题(Data structure judgement)
"Data structure" exercise library three: Judgment
The 1. program is the algorithm, bnot only has sequential storage structure and chain storage structure, but also has index structure and hash structure. ()
in the linear list, the address between the nodes of each chain must not be continuous.()
, if the linear table is inserted and deleted repeatedly, the linear table is more suitable for sequential storage structure.()
if the linear table uses the sequential storage structure, each data element occupies 4 storage units, and the storage address of the twelfth data elements is 144, then the storage address of the first data elements is 101.()
if the linear table of length is n, the sequential storage structure is used, and the n-i+1 elements in the table need to be moved before deleting the I elements of the table.()
The 24. symbol link (P) appears in the expression to indicate the content of the node referred to by P.()
25. will be moved to the P pointer which refers to the node of the next node is executed through P link (P).()
In the process of 26. non empty in a linear list by P to insert a node referred to by Q node is executed sequentially: link (q) -link (P) ; link (P) - Q.()
in the non empty double circular linked list by Q refers to the node to insert a node by P refers to the action as follows: llink (P) - Q, rlink (P) - rlink (q), rlink (q) - P, llink (rlink (q)) - P. 0
if the input sequence of a stack is 1, 2, 3, 4, then 4, 3, 1, 2 cannot be one of the output sequences of the stack.()
delete non empty chain storage structure of the stack (set the stack pointer top) process of an element is executed in sequence: P - top, top - link (P), call RET (P).()
if the queue using linked storage structure, team head pointer and pointer are respectively front and rear, to queue into a data information for the item element is executed in sequence: call GETNODE (P), data (P) - item, rear - P, front -p. 0
The 31. program