《数据结构》试卷二（Data structure test paper two）.doc

《数据结构》试卷二（Data structure test paper two） The most precious wealth is time. The greatest waste is wasted time. Data structure test paper two First, fill in the blanks: (20 points) 1, data structure, research data structure. 2, the algorithm is measured from two aspects of time and space, which are called analysis. 3, the linear table is n elements. 4 、 the storage structure of the linear table has. 5, the stack and queue are called linear table. 6, two fork tree, I layer has at most a node. 7, a two fork tree, each node up to only one child. 8, Hash technology key is two aspects. 9, two fork sorting tree, if the left subtree is not empty, then all nodes on the left subtree are the root node value. 10, AOV, a network of nodes and directed edges are represented. Two, individual choice questions: (20 points) 1, the physical storage structure must occupy storage space is continuous (-) (A) array (B) stack (C) two fork tree (D) list 2, the first root sorting sequence and the middle root sorting sequence () uniquely determine a two fork tree. (A) able (B) not (C) not necessarily. 3. The type () of each data item in the same record structure. (A) must (B) do not have to (C) not (D) impossible. 4, 4 elements into the S stack order is A, B, C, D, POP after operation (S) after the top of the stack is (-) (A) A (B), B (C), C (D), D 5, with n vertices and e edges of undirected graph G, the total number of nodes in the adjacency list table it is (-) (A) 2n (B), n (C), 2e (D), e 6, according to the order of the main two-dimensional array Amn sequence stored in memory, each array element accounted for 1 of the storage unit, the address of the AIJ element formula is: (________) (A) LOC (AIJ) =loc (a11) +[(i-1) *m+ (J-1)] (B) LOC (AIJ) =loc (a11) +[(J-1) *m+ (i-1)] (C) LOC (AIJ) =loc (a11) +[(i-1) *n+ (J-1)] (D) LOC (AIJ) =loc (a11) +[(J-1) *n+ (i-1)] 7, connected graph G has n vertices, and the spanning tree of G is () connected subgraph (A) all vertices containing G (B) contain all