考点一基本概念(算法、数据结构、线性表)1401（Test one basic concepts (algorithms, data structures, linear table) 1401）.docVIP

下载本文档

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

考点一基本概念(算法、数据结构、线性表)1401（Test one basic concepts (algorithms, data structures, linear table) 1401）.doc

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

考点一基本概念(算法、数据结构、线性表)1401（Test one basic concepts (algorithms, data structures, linear table) 1401）

考点一基本概念(算法、数据结构、线性表)1401（Test one basic concepts (algorithms, data structures, linear table) 1401） 21, do not take small evil for it, not to good small and not - Chen Shou, Three Kingdoms. Chapter 1: data structures and algorithms Test site 1: basic concepts (algorithms, data structures, linear tables) The following statement is correct (6.4) A) linear lists are linear chained storage structures (B), and stacks and queues are nonlinear structures C) the doubly linked list is a nonlinear structure D) and only the two tree of the root node is a linear structure The following statement is correct (6.9) A. algorithm has a large space complexity, and its time complexity must be large B. algorithm has a large space complexity, but its time complexity must be small C. algorithm has a large time complexity, but its space complexity must be small D: none of the above three statements are correct The following statement is correct (7.4) (A) the efficiency of the algorithm is only related to the size of the problem, but not to the storage structure of the data (B) the time complexity of an algorithm is the amount of computation required to perform the algorithm C) the logical structure of the data is in one-to-one correspondence with the storage structure (D) the time complexity of the algorithm is related to the spatial complexity The following statement is correct (7.9) (A) the efficiency of program execution is closely related to the storage structure of data; B) the efficiency of program execution depends only on the control structure of the program C) the efficiency of the program execution depends only on the amount of data that is being processed. D) the above three statements are incorrect The following statement is correct (7.9) A) the logical structure of the data and the storage structure must be one-to-one B) because the memory space of a computer is a vector storage structure, the storage structure of data must be linear (C) arrays in programming languages are gen