2000年混合班数据结构rdquo;试卷（Data structure of mixed class in 2000. The examination paper）.docVIP

下载本文档

1
0
约4.56千字
约 7页
2017-07-20 发布于河南
举报
版权申诉

2000年混合班数据结构rdquo;试卷（Data structure of mixed class in 2000. The examination paper）.doc

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

2000年混合班数据结构

2000年混合班数据结构rdquo;试卷（Data structure of mixed class in 2000. The examination paper） Mixed class data structure test paper in 2000 A selection and fill in the blanks (unless otherwise noted, generally every day 2 points, a total of 30 points) 1 which of the following statements is true?: (A) a stack is a linear list of operations at both ends, advanced and then out B) the stack is a linear list of operations at one end, first in first out C) a queue is a linear list of operations at one end, first in first out D) a queue is a linear list of operations at both ends, first in first out 2, it is known that the preorder traversal of a two fork tree is ABCDEF, and the result of traversal is CBAEDF: (A) CBEFDA B) FEDCBA C) CBEDFA D) indefinite 3, for Hashi (HASH) function H (k) = k, MOD, m, in general, m should be taken (A) prime number B) a large number C) even D) odd numbers 4 _____ conflict processing method of HASH search: (A) B) square taken C (Chinese French) dichotomy D) open address method 5. Which of the following sorting algorithms (all in memory) requires maximum memory?: A) select sort B) insert sort C) bubble sort D) merge sort 6, with sequences 12, 42, 37, 19, when using direct insertion sort from small to large order, the number of times for: A) 3, B) 4, C) 5, D) 6 7 which of the following sorting algorithms has the highest number of data exchanges?: A) select sort B) insert sort C) bubble sort D) merge sort 8, which of the following algorithm to determine whether a similar directed graph is ________ loop: Breadth first traversal algorithm, depth first traversal algorithm, minimum spanning tree algorithm, critical path algorithm, the shortest path Dijkstra algorithm, Topsort algorithm. 9, (3) set, to maintain a number of requirements: 1) to the set to insert a number, and 2) to delete the minimum and maximum number from the collection, do you think the best data structure is adopted: _______________ 10, (3) please list the main ____________________ algorithm