1993年程序员级试题离散数学方面的题解及分析（In 1993, the problem solving and analysis of discrete mathematics of programmer level test questions were given）.docVIP

下载本文档

5
0
约7.29千字
约 8页
2017-07-20 发布于河南
举报
版权申诉

1993年程序员级试题离散数学方面的题解及分析（In 1993, the problem solving and analysis of discrete mathematics of programmer level test questions were given）.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文档。上传文档

1993年程序员级试题离散数学方面的题解及分析（In 1993, the problem solving and analysis of discrete mathematics of programmer level test questions were given）

1993年程序员级试题离散数学方面的题解及分析（In 1993, the problem solving and analysis of discrete mathematics of programmer level test questions were given） Solutions and analysis of the 1993 programmers questions in discrete mathematics. Professor Geng Qinyun 1994-05-13 * test questions one (programmers morning questions four) From the choice of the answer, which should be entered on the data structure described below the correct answer in the, the number written in the corresponding column of the answer. 1. it is known that the preorder sequence and the ordered sequence of a two fork tree are: ABDEGCFH and DBGEACHF, then the sequence of the two fork tree is A, and the hierarchical sequence is B. 2., with n nodes for sorting, unstable sorting is C, the fastest sort of the largest comparison is D. 3., with 100 nodes, using dichotomy search, the maximum number of comparisons is E. Alternative answers: A, B:, GEDHFBCA, DGEBHFCA, ACBFEDHG, ABCDEFGH C: direct insertion sort; bubble sort; Shell sort; merge sort D:, nlog2n, II, N2, n2/2, n E:, 25, 50, 7, 10, four, three Answer: A:, B:, C:, D:, E:, D. Analysis: in order to find A, B answer, should be based on the two fork tree preorder sequence ABDEGCFH and the sequence sequence DBGEACHF, draw two fork tree, draw two fork tree, as shown in the following picture. According to the sequential method, the tree has a sequence of DGEBHFCA, This is the choice of the answer, namely level sequence ABCDEFGH, Thats exactly what the answer is, In Cs answer, only the shell ranking is unstable, so the answer to C should be 3. The maximum number of times for a quick sort is N2, so the answer to D is 2. By dichotomy, the maximum number of times of comparison is log2n [log2100] =7, so the answer to E should be. * test questions two (programmer level morning questions 6) From the alternative answer, you should fill in the correct answer in the data structure statement below. The following diagram is the adjacency table representation of the weighted directed g