- 1、本文档共14页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
计算机专业数据结构试题799(Professional computer data structure test 799)
计算机专业数据结构试题799(Professional computer data structure test 799)
12, energy-saving, white square regret later reading -- Yan Zhenqing
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 nodes on the left subtree
您可能关注的文档
- 获奖教学设计(Teaching Design Award).doc
- 菊花品种(Chrysanthemum Cultivars).doc
- 荷兰豆-新品种分类(New varieties of peas - Classification).doc
- 菜谱-做饭很简单(Recipe - cooking is easy).doc
- 药学规划(Pharmaceutical planning).doc
- 菜鸟充电重新认识ntfs的妙处(Rookie NTFS re charging beauty).doc
- 菜谱-做饭(Recipe - Cooking).doc
- 菜鸟入门解析(Rookie entry analysis).doc
- 菜鸟和狗头(Rookie and head).doc
- 菜鸟成长手册—diy新手宝典(Rookie growth manual DIY novice book).doc
最近下载
- 2024年党员干部党纪学习教育读书班学习《中国共产党纪律处分条例》研讨发言.doc VIP
- 民用微高压氧舱技术要求2022.docx
- 廊桥遗梦英文剧本TheBridgesofMadisonCounty.pdf
- 丁基内胎的技术.docx
- 2019年国家科学技术奖提名项目公示内容(技术发明奖)一、提名意见.PDF
- 消毒供应中心提高包装合格率PDCA.pptx
- 2023年高考语文新课标全国Ⅰ卷真题试卷【精品解析】.pptx
- 人教版(2019)高中物理选择性必修第三册_热力学第二定律.pptx
- 242-分析化学实验(40学时)分析化学实验指导书南京大学出版社.ppt
- 2深入浅出stm8单片机入门、进阶与应用实例前言.pdf
文档评论(0)