《数据结构》作业习题(Data structure homework exercises).doc

《数据结构》作业习题(Data structure homework exercises).doc

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

《数据结构》作业习题(Data structure homework exercises) All restrictions begin almost from within. Data structure Featured Exercise Jicui Bibliography: [1] national computer technology and software professional qualification (level) examination 2004, 2005 first half of the examination questions analysis and solution tsinghua university press [2], Liang Zuojuan and so on, data structure, exercises, answers and examination guidance, Tsinghua University press The first chapter is introduction Judgment: (CAS 1999) Sequential storage can only be used to store linear structures. The sequential lookup method is suitable for storing linear tables in order of structure or linked storage. - wrong - on Fill in the blanks: (Chinese Academy of Sciences, 1999) For a given n element, the logical structures that can be constructed are (,,,,,,,,,,,,,) four. - set - linear structure Tree structure - graph structure Selection: (CAS, 2001) The computer algorithm must have 5 characteristics, such as input, output, and so on. A. feasibility, portability and scalability, B. feasibility, certainty and poverty C. deterministic, poor and stable, D. readability, security, and stability B Questions and answers: (University of Science and Technology Beijing, 2002) There are usually several ways of representing the logical structure of a data in the image (or representation) of a computer storage - sequential images and non sequential images What are the characteristics of linear structure and tree structure? - there is a relationship between one data element in the structure - there is a relationship between multiple data elements in the structure Choice: (Wuhan Polytechnic 2002) The characteristics of an algorithm that can be handled when an illegal operation occurs is called () A. correctness, B. readability, C. robustness, D. reliability C Answer: (Wuhan Polytechnic 2002) A brief description of the relation between sequential storage structures and chained storage structures in relation to data elemen

文档评论(0)

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

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

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档