《c语言数据结构》第章__自测卷答案(C language data structure of the second chapter __ self testing volume answer).doc
- 1、本文档共36页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《c语言数据结构》第章__自测卷答案(C language data structure of the second chapter __ self testing volume answer).doc
《c语言数据结构》第2章__自测卷答案(C language data structure of the second chapter __ self testing volume answer)
There is no disappointment in the world. Only the person who is desperate for the situation, the biggest bankruptcy is despair, and the biggest asset is hope.
The second chapter self examination volume answer name class
Question no.
One
Two
Three
Four
Five
Six
Seven
The total score
Item
Thirteen
Ten
Ten
Ten
Seven
Ten
Forty
One hundred
Score
First, fill in the blanks (1 points per space)
A total of 13 points
1. [strict topic set 2.2] insert or delete an element in a sequence table
You need half of the average moving table
The number of elements moving is related to the length of the table and the location of the element in the table
2. the set of nodes in a linear table is finite
The relationship between nodes is one to one
3. to a vector of length n of the first I elements (1 I n+1) before inserting an element
You need to move n-i+1 elements backwards
A length of 4. to delete the first I element of the N vector (1 i n) when
You need to move n-i elements forward
5. the time complexity of accessing any node in the sequence table is O (1)
therefore
The sequential table is also called random access data structure
6. [strict question set 2.2] the physical location of the logically adjacent elements in the order table must be contiguous
The physical locations of logically contiguous elements in a single list are not necessarily contiguous
7. [strict question set 2.2] in single linked list
In addition to the first node
The storage location of any node is indicated by the value of the chain domain of its direct predecessor
8. in the N node single linked list to delete the known node *p
You need to find the address of its predecessor node
The time complexity is O (n)
Two, judge (tick the correct statement
And playing every day 1 points (fork)
A total of 10 points
(x) each node of the 1. linked list contains exactly one pointer
Answer: wrong
The nodes in a linked list can contai
您可能关注的文档
- 1986--2009历年考研英语真题及答案解析(word版).doc
- 电影金钱世界All.The.Money.In.The.World.2017剧本台词中英文对照完整版 - 副本.doc
- 环境影响评价报告公示:华北制药集团先泰药业氨苄西林钠母液溶媒回收建设单位华北环评报告.doc
- (含公式自动计算)收支平衡分析表模板.doc
- 用adb命令root盒子和手机(Using ADB command root box and mobile phone).doc
- A卷烟商品营销员》之基本社交礼仪(DOC ).doc
- 模电设计由比较器构成的光动报警电路 康成 .doc
- 环境管理体系内审员培训教程(下)(课程编号:CQ_B)课后测试解析.doc
- 分牛人考研英语笔记(一)( point English exam notes ).doc
- 汽车尾气排放曹春阳最新版副本.docx
文档评论(0)