数据结构(本)课程作业（Data structure (this) course assignments）.doc

下载文档 降价啦

5
0
约1.28万字
约 16页
2017-08-02 发布于河南
举报
版权申诉
保障服务

数据结构(本)课程作业（Data structure (this) course assignments）.doc

1、本文档共16页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

数据结构(本)课程作业（Data structure (this) course assignments） The secret to staying young is having a restless heart. Data structure (this) course assignments Assignment 1 (this section covers the contents of chapter 1-2 of the textbook) First, individual choice questions 1., in the data structure, the data structure can be logically divided into (C). A. dynamic structure and static structure, B. compact structure and non compact structure C. linear structure and nonlinear structure, D. internal structure and external mechanism 2. the following statement is incorrect (D). The A. data element is the basic unit of data The B. data item is the smallest smallest identifiable unit in the data C. data can consist of several data elements The D. data item can consist of several data elements 3. a storage node stores one (B). A. data item B. data element C. data structure D. data type 4. in the data structure, what is independent of the computer used is data (C). A. storage structure, B., physical structure C. logical structure, D. physics and storage structure 5. the following statements do not belong to algorithmic characteristics (D). A. has poor B. input C. feasibility, D. readability 6. the purpose of algorithm analysis is (C). A. finds the rationality of data structures; B. studies the relation between input and output in algorithms C. analyzes the efficiency of the algorithm in order to improve the understandability and documentation of the D. analysis algorithm 7. data structure is a scientific study of (B) objects and their relationships. A. numerical operations, B. non numerical operations C. set D. non set 8., the time complexity of the algorithm is related to (D). The computer B. used by A. and the operating system of the computer C. and algorithms themselves, D., and data structures 9. has an order of length N, and the number of moving elements is (A) before the I element (that is, the insertion element is the I element of the new table). A.n-i+1 B.n-i C.n-i-1 D.i 10.