计算机专业英语电子教案郭敏 计算机专业英语Unit6.ppt

Unit 6 Section 2 Passage A algorithm data structure character table list stack queue tree array node LIFO tail Unit 6 Section 2 Passage B linear table Integer direct precursor element direct successor element head rear insertion deletion sequence form chain form pointer reflection Unit 6 Section 2 Passage B Contrarily, if we want to delete node b that between node a and c in the link list, what we need is only to assign address of node c to pointer field of node a. After deleting, node c become the direct successor of node a. To sum up, it only need to modify the pointer value without having to move elements, when we inserting or deleting an element to or from the link list. In view of the advantage of link list in the rational utilization of space and in easy realization of insertion and deletion, it is the preferred storage structure of linear table. Unit 6 Section 2 Passage B Exercises I 1. ( ) Linear table can be stored in computer either in sequence form or in chain form. 2. ( ) Link list is a random access structure. 3. ( ) There are considerable motions of elements existing in insertion and deletion operation of sequence list. 4. ( ) In link list, the storage location of each element can be obtained simply by the formula. 5. ( ) Insertion and deletion with link list are much easier than with sequence list. T F T F T Unit 6 Section 2 Passage B Exercises II up accessed removals removed down This implementation stores the list in an array. The Array List has the following properties: ? The position of each element is given by an index from 0 to n-1, where n is the number of elements. ? Given any index, the element with that index can be 1._________ in constant time i.e. the time to access does not depend on the size of the list. ? To add an element at the end of the list, the time taken does not depend on the size of the list. However, the time taken to add an element at any other point in the list does depend on the size of the list, as all subsequent