1993年程序员级试题离散数学方面的题解及分析（Solutions and analysis of the 1993 programmers questions in discrete mathematics.）.docVIP

下载本文档

0
0
约6.97千字
约 8页
2017-09-05 发布于河南
举报
版权申诉

1993年程序员级试题离散数学方面的题解及分析（Solutions and analysis of the 1993 programmers questions in discrete mathematics.）.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年程序员级试题离散数学方面的题解及分析（Solutions and analysis of the 1993 programmers questions in discrete mathematics.）

1993年程序员级试题离散数学方面的题解及分析（Solutions and analysis of the 1993 programmers questions in discrete mathematics.） Solutions and analysis of the 1993 programmers questions in discrete mathematics. Professor Geng Qinyun 1994-05-13 - a test (programmer morning test 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. The preamble sequence 1. known two binary tree and sequence were ABDEGCFH and DBGEACHF, after the sequence of the two fork tree for A level sequence is B. With 2. n nodes are sorted, the sort of instability is C, the maximum number of relatively quick sort is D. 3. with 100 nodes, with a binary search, the maximum comparison number is E. Choose the answer: A B:, GEDHFBCA DGEBHFCA and ABCDEFGH ACBFEDHG. C: direct insertion sort and shell sort, bubble sort, merge sort D: nlog2n N2 n2/2 n 4 3 2 E: 25 50 10 7. Answer: A: B: and C: D: of the E:. Analysis: in order to find the A B, the answer should be based on the preamble sequence ABDEGCFH two binary tree and the sequence of DBGEACHF, draw the two fork tree, draw two fork tree as shown below. According to the order of the times around the tree sequence method DGEBHFCA, This is the choice of the answer, namely level sequence ABCDEFGH, This is the choice of the answer, C for answers, only the shell ranking is not stable, so the C should be the answer. The maximum magnitude comparison number of quicksort is N2, so the answer is D. With the maximum magnitude of binary search, compare the number of log2n log2100 =7 E, the answer should be. - test two (programmer morning test 6) Selected from the choice of the answer should enter the data on the structure of narration in the correct answer. The figure is a weighted digraph representation of a G adjacency list. The node node sequence of V1 G from the depth of the graph traversal is A; node sequence breadth traversal graph from G is B; a topo