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

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

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

《数据结构》试卷二(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

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档