2009数据结构期末试卷1234（2009 data structure final exam 1234）.docVIP

下载本文档

7
0
约8.36千字
约 11页
2017-09-27 发布于河南
举报
版权申诉

2009数据结构期末试卷1234（2009 data structure final exam 1234）.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文档。上传文档

2009数据结构期末试卷1234（2009 data structure final exam 1234）

2009数据结构期末试卷1234（2009 data structure final exam 1234） Xuzhou Institute of technology papers School year, semester, course name, data structure Types of examination papers, examination forms, examination time, minutes A proposition; a person; a date; a class Chief of teaching and Research Office, day, Dean, day and month Name, class, student number Question no. One Two Three Four Five Six Seven Eight The total score The total score Twenty Fifteen Fifteen Ten Forty Score First, fill in the blanks (12 items, each 1 points, a total of 20 points) 1. stacks and queues are _______ for stack structure; only in the _______ insert and delete elements; only in the queue for ______ insert and remove elements elements in _______. 2. a generalized list of elements is divided into elements and elements of two kinds of _______ _______. 3. for a length of storage order of the N line, in the header element is inserted and the time complexity is _________, at the end of the table, insert the elements and the time complexity is _________. 4. with n nodes in a tree of two binary tree, all nodes of the tree is equal to the number of _________ loopholes. 5. if the vertex set of a graph is {a, B, C, D, e, f}, edge set {(a, b), (a, c), (B, c), (D, e)}, the graph containing _________ connected components. 6. in the direct insertion sort, the initial data and compare the number of data is arranged _________; and in the direct selection sort, the initial data and compare the number of data is arranged _________ off. 7. if the keyword sequence (43, 02, 80, 48, 26, 57, 15, 73, 21, 24, 66) on an increment of 3 Hill sort, the results obtained for _____________________________________________. 8. in the ordered list (12, 24, 36, 48, 60, 72, 84) in the binary search keyword 72 required to compare the number of keywords for _________. 9. linear table hash storage, processing and _______________ conflict ________________ two methods. 10. known a degree 3 tree has 2 to 1 nodes and 3 degrees for 2 nodes