数据结构习题与答案（Data structure exercises and answers）.doc

下载文档 降价啦

15
0
约5.84千字
约 7页
2017-08-02 发布于河南
举报
版权申诉
保障服务

数据结构习题与答案（Data structure exercises and answers）.doc

1、本文档共7页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

数据结构习题与答案（Data structure exercises and answers） 1., if a linear table is usually used to take the I element and its predecessor elements, then (A) storage way to save the most time A. sequential table B. single linked list C. double linked list D. one-way cycle The 2. string is a finite number (B) A sequence consisting of sequences of B. characters consisting of A. symbols A collection of C. symbols; a collection of D. characters 3. set the elements of the matrix A (AIJ, 1=i, j=10) to satisfy: Aij0 (i=j, 1=i, j=10), AIJ, =0 (ij, 1=i, j=10) If all of the non 0 elements of A are stored in the storage area of the first address of 2000, each element occupies 4 units, then the first address of the element A[59] is (C) A.2340 B.2336 C.2220 D.2160 4., if the list is used as the storage structure of the stack, then the stack operation is removed (D) A. must determine whether the stack is dry and B. does not make any distinction to the stack C. determines the type of stack element. D. must determine whether the stack is empty 5. set the array Data[0..M] as the storage space of the cyclic queue SQ, the front as the header pointer, and the rear as the tail pointer of the queue, and the statement of executing the team operation is (A) A.front= (front+1)% (m+1) B.front= (front+1)% m C.rear= (rear+1)% m D. front=front+1 6. two trees with a depth of 6 (1 of the root level), at most (B) nodes A.64 B.63 C.31 D.32 7., take 100 nodes of the complete two fork tree from the root of this layer, each layer from left to right in the number of nodes, the root node number is 1. The parent number X of node 47 is (C) A.24 B.25 C.23 D.2 cannot be determined 8., there is an undirected graph G= (V, E) and G= (V, E). If Gis the spanning tree of G, the following incorrect statement is (D) A.GG B.G G a subgraph of an acyclic subgraph C.Gis the minimal connected subgraph of G and the connected component of V=V D.G is G 9. using a linear probe to find a closed hash, you might want to detect multiple h