《数据结构》7044(Data structure, 7044).doc

  1. 1、本文档共30页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
《数据结构》7044(Data structure, 7044) 16. Efficiency comes from diligence. shortage in the play. - Han Yu Volume B Data structure ID name ________ __________ fraction __________ Question no. One Two Three Four Five Six The total score Fraction A RadioButtonList (every day, 1 points, 10 points) 1. the data form is independent of the form, content, relative position, number of data elements themselves A. storage structure, B. logic structure, C. algorithm, D. operation Compared to the sequential stack, the 2. chain stack has one obvious advantage The A. insertion operation is more convenient and B. usually does not appear full C. does not appear empty stack, D. delete operation is more convenient 3. divide the sequence of sorted elements into two left and right sub sequences, and then apply the same sort operations to the two sub sequences until the subsequence is empty or has only one element left This sort of sorting method is () A. direct selection sort, B. direct insertion sort, C. quick sort, D. bubble sort 4. if the adjacency matrix is used to store an undirected graph of n vertices, then the adjacency matrix is a () A. three solutions matrix, B. sparse matrix, C. diagonal matrix, D. symmetric matrix 5. in a cyclic queue stored sequentially, the head of the team refers to the element of the header element A. the last position, B., the latter position, the C. team, the head element position, the D. position, the last element of the tail element 6. the advantage of using a linked list to represent linear tables is () A. facilitates random access, and B. spends less storage space than sequential tables C. facilitates insertion and deletion of D. data elements with the same physical order as in logical order 7. direct insertion of 5 different data elements, most of which need to be (or) compare A.8 B.10 C.15 D.25 8. in the following storage form, () is not the storage form of the tree A. parent notation, B., left child, female, right brother, notation, C., generalized ta

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档