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

CHAPTER 11 Data Structures Review Questions 1. We need data structures to hold a collection of related variables so that we can solve complex problems more efficiently. 2. Arrays, records, and linked lists 3. An array is a fixed-size sequenced collection of elements of the same data type. 4. All elements of an array must be of the same type and they are accessed by using an index appended to the array name. Elements of a record can be of the same or different types and are accessed by use of a member operator. 5. Elements of an array are contiguous in memory and can be accessed by use of an index. Elements of a linked list are stored in nodes that may be scattered through- out memory and can only be accessed via the access functions for the list (i.e., a specific node is returned by a search function). 6. We use indices rather than subscripts because placing the index in a set of brackets after the array name allows us to do things like use a variable to specify an index. 7. A frequency array shows the number of elements with the same value found in a particular collection of data. 8. A histogram is a pictorial representation of a frequency array. 9. An array is stored contiguously in memory. A two-dimensional array uses row- major storage in which the array is essentially stored as an array of arrays. 10. A field is the smallest element of named data that has meaning. 11. The fields of a node in a linked list a