datastructuremidterm(answer).docVIP

第  PAGE 4 页 共  NUMPAGES 4 页 南京信息工程大学试卷 2008－ 2009学年 第 1 学期 Data Structure 课程试卷(期中卷) 本试卷共 7 页；考试时间 120 分钟；任课教师 Hou Rongtao ；出卷时间 08 年 10 月 Computer and software 学院 Application computing 专业 07年级 1-4 班 No. Name Score 1．Concept explaining (20 point) Data structure is set of data and of relationships between the data. Time complexity is running time analysis. (3) A list can be implemented using arrays on a machine and data elements are stored in a contiguous manner (4) Data is stored at random locations and the current data location provides the information regarding the location of the next data. Elements connected by pointer links. Using pointers to point to the next element. (5) A Queue is a data structure in which insertions take place at one end and deletions take place at the opposite end. (6) A stack is a data structure in which all insertions and deletions of elements are made at one end. The last element which is inserted is the first one that will be removed. (7) A binary tree is a finite set of nodes that is either empty or consists of a root together with two binary trees, called the left subtree and the right subtree, which are disjoint from each other and from the root. (8) An Abstract Data Type (ADT) is a data type that is organized in such a way that the specification on the objects and specification of the operations on the objects are separated from the representation of the objects and the implementation on the operations. (9) An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. (10)Depth of a tree is the length of the longest path from root to leaf. 2．Single choice (15 point) (1)A. (2) A. (3) C. (4) C (5)B. (6) B (7) A (8) D (9) A (10) C (11) 260 (12) A (13)A. (14) A (15) D. 3. True or False (10 point) ×××√ ×√√××√ 4. Ask and answer (40 point) (1) Insertion into a Listed List, create a new node firstly and then insert this node before the i