数据结构试卷(Data structure test paper).docVIP

数据结构试卷(Data structure test paper).doc

  1. 1、本文档共16页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
数据结构试卷(Data structure test paper)

数据结构试卷(Data structure test paper) Only love is the best teacher. It is far more than a sense of responsibility. The first semester of 04/05 school in Chaohu radio and TV University Open education computer major data structure midterm examination paper Grade ____________ ID name ___, a multiple-choice score (2 points per question) 1, the data form of the data element itself, content, relative location, number is independent of the data A storage structure, B logic structure, C algorithm, D operation 2, the chain stack is compared with the sequential stack One of the obvious advantages is () A insert operation is more convenient, B usually does not appear full stack, C will not appear empty stack, D delete operation is more convenient 3. A linear table is a finite sequence with n A. table elements, B. characters, C. data elements, D. data items 4, for a two fork tree preorder traversal results of ABDEFC The result of inorder traversal is DBFEAC The result of a subsequent round trip is () A.DBFEAC B.DFEBCA C.BDFECA D.BDEFAC 5, in a cyclic queue stored sequentially The header pointer to the header element A the last position, B, the latter position, the C team, the head element position, the D position, the last element of the tail element 6, the advantages of using a linked list to represent linear tables are A facilitates random access, and B spends less storage space than sequential tables C facilitates insertion and deletion of D data elements with the same physical order as in logical order 7. If the depth of a full two tree is h The at least ______ nodes completely two binary tree () A.2h B.2h-1 C.2h-1-1 D.2h-1+1 8, in the following storage format () not the storage form of a tree A parent notation, B, left child, female, right brother, notation, C, generalized table representation, D sequential representation 9, in a tree with 5 layers of two nodes in the tree for points () A 31, B 32, C 33, D 16 10, if the depth is 6, the complete two branch tree has 3 leaf node

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

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

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档