计算机概论教学（英文版）华南理工-Ch-12.pdfVIP

CHAPTER 12 Abstract Data Types Review Questions 1. An abstract data type is a data declaration packaged together with the operations that are meaningful for the data type with the implementation hidden from the user. 2. In an ADT, the operations that the user uses to access the data are known and the implementation of the data type and the operations are hidden. 3. A linear list is a list in which each element has a unique successor. 4. In a general list, data can be inserted and deleted anywhere and there are no restric- tions on the operations that can be used to process the list. In a restricted list, data can only be added or deleted at the ends of the structure and processing is restricted to operations on the data at the ends of the list. 5. Two common implementations of a general list are an array and a linked list. 6. The advantage of using a linked list for the implementation of a linear list is that data can be inserted or deleted anywhere in the list without having to reallocate the list as would have to be done with an array. 7. A push operation adds an element to the top of the stack while a pop operation removes an element from the top of the stack. A push can put the stack in an over- flow condition while a pop can put the stack in an underflow condition. 8. Reversing data, parsing data, postponing data usage, and backtracking steps. 9. The enqueue operation adds an element to the rear of a queue. The dequeue opera- tion removes the element at the front of the queu