《数据结构》作业习题（国外英文资料）.docVIP

《数据结构》作业习题 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 elements is given. Adjacent to physical l