- 1、本文档共14页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
计算机专业数据结构试题8437(Professional computer data structure test 8437)
计算机专业数据结构试题8437(Professional computer data structure test 8437)
37. thirty-six thousand days, every night when the light of a candle
- Li Bai
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 l
您可能关注的文档
- 菜鸟成长手册—diy新手宝典(Rookie growth manual DIY novice book).doc
- 菠萝蜜种植技术twgav(Jackfruit twgav planting technology).doc
- 菩提子种类大全(The complete variety of Bodhi sons).doc
- 营业员岗位职责(Sales staff responsibilities).doc
- 营业铁路并行三线改建施工技术(Construction technique of parallel three lines reconstruction of commercial Railway).doc
- 菏泽市公交车规划线路一览表(Heze city bus line planning list).doc
- 营养学教材详解(Nutrition textbook detailed).doc
- 营改增应税服务差额纳税解析(Analysis of the difference between the tax increase and the taxable service).doc
- 营造文化环境 促进教师成长(Building a cultural environment to promote teacher development).doc
- 营造绿色寝室创建生态校园(Building a green dormitory and building an ecological campus).doc
- 新的一年工作展望.docx
- 医生年终个人工作的述职报告(3篇).docx
- 2023年消防设施操作员之消防设备中级技能考前冲刺练习题附答案详解.docx
- 2022-2023年环境影响评价工程师之环评技术导则与标准通关练习题包括详细解答.docx
- 2023年中级注册安全工程师之安全生产管理考前冲刺检测卷和答案.docx
- 2023年中级银行从业资格之中级银行管理考前冲刺测试卷提供答案解析.docx
- 2023年公共营养师之二级营养师通关模拟考试试卷附带答案.docx
- 证券分析师之发布证券研究报告业务考前冲刺模拟题库.docx
- 2022-2023年二级建造师之二建建设工程法规及相关知识综合提升测试卷附答案.docx
- 2023年二级建造师之二建机电工程实务通关模拟考试试卷提供答案解析.docx
1亿VIP精品文档
相关文档
最近下载
- 安全培训篇——烟花爆竹储存作业实操技能.pptx
- 民法典(侵权责任)精品题库+解析.pdf VIP
- Unit 10 Birthday Food Around the World 经典最新版课件.ppt
- 个人简历模板下载个人简历表格模板.docx
- 人教版小学五年级数学下册期末测试题(含解析)图文.doc
- 四川省成都市第七中学2023届高三零诊模拟考试英语试题(含答案).pdf VIP
- 业财融合下的财务工作思路.docx
- 中考语文复习考点帮(广东专用)考点二 诗词曲阅读(模拟精练)(解析版).docx
- 锁骨下动脉狭窄的护理查房.pptx
- 某石油公司领导在“转观念、勇创新、强管理、创一流”主题教育宣讲会上的讲话.docx VIP
文档评论(0)