《数据结构》作业习题（Homework exercises of data structure）.docVIP

《数据结构》作业习题（Homework exercises of data structure） Read a good book, like making a good friend. - Cangkejia Data structure Featured Exercise Jicui Bibliography: [1] national computer technology and software professional qualification (level) examination 2004 and 2005 in the first half of the examination questions analysis and solution tsinghua university press [2], Liang Zuojuan, etc., data structure Exercises answer and examination guidance, Tsinghua University press The first chapter is the introduction Judgment: (Chinese Academy of Sciences 1999) Sequential storage can only be used to store linear structures. The sequential lookup method is applicable to linear tables with storage structures of sequential 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: input, output, () and so on. A. feasibility, portability and scalability, B. feasibility, certainty and poverty D. readability, security and stability of C. deterministic, finite and stable B Q A: University of Science and Technology Beijing (2002) How are the logical structures of data stored in computer storage (or representation) in several ways? - sequential mapping and non sequential mapping What are the characteristics of linear structure and tree structure? There is a relationship between the data elements in the structure There is a relationship between multiple data elements in the structure Selection: (Wuhan Polytechnic 2002) The characteristics of an algorithm that can be processed when an illegal operation occurs is called () A. correctness, B. readability, C. robustness, D. reliability C Answer: (Wuhan Polytechnic 2002) The difference between sequential storage structure and chained storage structure in representing data elements is explained.