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

CHAPTER 13 File Structures Review Questions 1. A file is an external collection of related data treated as a unit. The primary pur- pose of a file is to store data. 2. Sequential access and random access 3. We need an EOF marker at the end of a sequential file so that we know when we reach the end of the file during processing. 4. The old master file is the file that should be updated while the new master file con- tains the current data (the data from the old master file including any changes that were made during the update). 5. The transaction file contains any changes that should be made to the old master file. 6. Solution may vary. 7. Solution may vary. 8. The address is the position within the file where the needed information is stored. 9. The index stores a table that relates the keys of the data items to the addresses in the file where the data are stored. 10. In direct hashing, the key is the address without any algorithmic manipulation. 11. In modulo division hashing, the key is divided by the file size and the remainder plus 1 is used as the address of the data. 12. In digit extraction hashing, certain digits are removed from the key and used as the address of the data. 13. A collision is an event that occurs when a hashing algorithm produces an address for an insertion and that address is already occupied. 14. Open addressing, linked list resolution, and