计算机专业数据结构试题196（Professional computer data structure test 196）.docVIP

下载本文档

0
0
约8.98千字
约 14页
2017-08-17 发布于河南
举报
版权申诉

计算机专业数据结构试题196（Professional computer data structure test 196）.doc

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

计算机专业数据结构试题196（Professional computer data structure test 196）

计算机专业数据结构试题196（Professional computer data structure test 196） 3, learning without thought is labor lost, thought without learning is perilous. -- Confucius Computer data structure examination questions A RadioButtonList (every day, 2 points, 12 points) 1. in a single chain table HL, if you want to insert a pointer to the table header, the node is executed (P) A.HL = p; P = next = HL, B.p = next = HL; HL = p; C.p = next = Hl; P = HL; D.p = next = HL, next; HL = next = p; The strongly connected graph of 2.n vertices contains at least () The A.n-l strip has the right edge, the B.n strip has the directed edge, C.n (n-1) / 2 has the directed edge, D.n (n, 1) has the directed edge 3. when searching for an element from a two fork tree, the time complexity is roughly A.O (1), B.O (n), C.O (1Ogzn), D.O (N2) 4., a Huffman tree is generated from the leaf nodes with weights of 3, 8, 6, 2, 5, and the weighted path length is () A.24 B.48 C.72 D.53 5., when an object that is actually passed on takes up a larger storage space and may need to be modified, it should be best described as () parameters to save space for parameter values, transmission times, and storage parameters A. plastic B. reference type C. pointer type D. constant reference type 6., the average time complexity of inserting a new element into a sequential table of length n is () A.O (n), B.O (1), C.O (N2), D.O (10g2n) Two, fill in the blanks (1 points per minute, 28 points) 1. the storage structure of data is divided into -- -- -- -- and -- four 2. in the storage structure of generalized tables, there is a domain corresponding to a single element node and a table element node, and they are respectively domain and domain 3.-- 30 x* infix expression (2.4 / 5-6) suffix expression corresponding to the. 4. in a h tree with a height of 3, there is at most a node 5. suppose the number of nodes for a tree of two forks is 18, its minimum depth is -- and its maximum depth is -- 6. in a two fork search tree, the value of all