Exam 13: File Structure

The index of an indexed file has _______ fields.

In the _______ hashing method, selected digits are extracted from the key and used as the address.

In the _______ hashing method, there are no synonyms or collisions.

When a sequential file is updated, the ______ file contains the changes to be applied.

_______ file can be accessed sequentially.

When a sequential file is updated, the ______ file gets the actual update.

When a hashing algorithm produces an address for an insertion key and that address is already occupied, it is called a _______.

The _______ area is the file area that contains all the home addresses.

When a sequential file is updated, the ______ file contains a list of all errors occurring during the update process.

If the transaction file key is 20 with a delete code and the master file key is 20, then we _______.

In the ______ collision resolution method, we try to put data that cannot be placed in location 123 into location 124.

If the transaction file key is 20 and the first master file key is 25, then we _______.

After a sequential file is updated, the _______ file contains the most current data.

The address produced by a hashing algorithm is the _______ address.

In the _______ hashing method, the key is divided by the file size, and the address is the remainder plus 1.

_______ file can be accessed randomly.

_______ are keys that hash to the same location in the data file.