1990 年度程序员水平考试试题上午试题（1990 programmer proficiency test questions in the morning）.docVIP

下载本文档

3
0
约1.12万字
约 21页
2017-10-05 发布于河南
举报
版权申诉

1990 年度程序员水平考试试题上午试题（1990 programmer proficiency test questions in the morning）.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文档。上传文档

1990 年度程序员水平考试试题上午试题（1990 programmer proficiency test questions in the morning）

1990 年度程序员水平考试试题上午试题（1990 programmer proficiency test questions in the morning） Examination questions 1 In the sorting algorithm, each item is compared with the other items, and the number of items less than the item is calculated to determine the location of the item called __A__. The hash function has a common property, that is, the letter value should take __B__ for each value of its range. There are two strings P and Q, where q is the substring of P. The location of the first occurrence of Q in P, as the substring, the location of the Q in P, is called __C__. If a linear table is required to find quickly and adapt to the dynamic changes, the __D__ method can be used. The amount of computation of the algorithm is called the computational __E__. Alternative answers: A: Insert sort Exchange sort Sort selection Enumeration sorting B: Maximum probability Minimum probability Mean probability Equal probability C: Connection Matching The substr String length D: Block Sequence Dichotomy Attribute based E: Reality Difficulty Complexity Efficiency Examination questions 2 From the tree described, select five correctly described, and according to the order from small to large numbers written on the answer sheet A ~ E column. There are two nodes in each node of the two tree, but there is no limit to the general tree. Therefore, the two fork tree is a special case of the tree. When k = 1, height K two fork tree has at most 2k-1 nodes. The preorder traversal of trees can be derived by preorder traversal and preorder traversal of trees. The advantage of the two tree is that it is convenient to find the forward node and the succeeding node in the middle sequence. After converting a tree into two branches, the root node has no left subtree. The tree with n nodes completely two forks tree, its height is |log2n +l. The insertion node in two binary tree, the two tree is no longer two fork tree. The storage structure using two binary linked list tree, preorder traversal preorder tree