access课后习题答案 - 副本（Access after-school exercise answers - copy）.docVIP

下载本文档

4
0
约1.4万字
约 15页
2017-08-21 发布于河南
举报
版权申诉

access课后习题答案 - 副本（Access after-school exercise answers - copy）.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文档。上传文档

access课后习题答案 - 副本（Access after-school exercise answers - copy）

access课后习题答案 - 副本（Access after-school exercise answers - copy） Two class public foundation after-school exercise answers The first chapter The first section Answer: D, 1 The time complexity of the algorithm is not only related with the scale of the problem, but also related to the input data, the input data of all the possible value range and input data or data set is related to the probability of. So the correct answer D. Answer: C, 2 The time complexity of the algorithm is to execute the workload required by the algorithm, namely the number of basic operations. The second section Answer: D, 1 Analysis: the data storage structure refers to the storage in the form of the logical structure of the data in the storage space in the computer. Answer: A, 2 Analysis: the logical structure of the data, is from the reality, the constructed data structure to achieve specific functions, used to describe logical relationships between data elements, it is problem oriented. The fourth section Answer: A, 1 Analysis: in the structure of chain store in the storage space in the storage data structure can not continuous, the logical relationship between the data and the data elements stored in the order of nodes can be inconsistent. Answer: A, 2 Analysis: list the advantages in the insert and delete operations, only need to change the pointer, without moving elements, when the storage space is insufficient, can dynamically assign memory space, so there is no need to estimate the size of storage space. The order of the table can be random access to any node, and the list must start from the first data node, one by one for each node. So the correct answer is A. The fifth section Answer: B, 1 Analysis: basic operations: stack into the stack, the stack (remove the top element on the stack), initialization, empty and full, to determine whether the stack is empty or from the top of the stack, the stack operation is carried out at the top of the stack. The sixth section Answer: C, 1 Analysis