Question 1

The index of an indexed file has _______ fields.

Accepted Answer

A)  two 
B)  three 
C)  four 
D)  any number of A

Question 2

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

Accepted Answer

A)  direct 
B)  division remainder 
C)  modulo division 
D)  digit extraction D

Question 3

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

Accepted Answer

A)  direct 
B)  modulo division 
C)  division remainder 
D)  digit extraction A

Question 4

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

Accepted Answer

A)  new master 
B)  old master 
C)  transaction 
D)  error report

Question 5

_______ file can be accessed sequentially.

Accepted Answer

A)  A sequential 
B)  An indexed 
C)  A hashed 
D)  No

Question 6

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

Accepted Answer

A)  new master 
B)  old master 
C)  transaction 
D)  error report

Question 7

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

Accepted Answer

A)  collision 
B)  probe 
C)  synonym 
D)  linked list

Question 8

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

Accepted Answer

A)  probe 
B)  linked 
C)  hash 
D)  prime

Question 9

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

Accepted Answer

A)  new master 
B)  old master 
C)  transaction 
D)  error report

Question 10

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

Accepted Answer

A)  add the transaction to the new master file 
B)  revise the contents of the old master file 
C)  delete the data 
D)  write the old master file record to the new master file

Question 11

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

Accepted Answer

A)  open addressing 
B)  linked list 
C)  bucket hashing 
D)  random hashing

Question 12

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

Accepted Answer

A)  add the new record to the new master file 
B)  revise the contents of the old master file 
C)  delete the data 
D)  write the old master file record to the new master file

Question 13

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

Accepted Answer

A)  new master 
B)  old master 
C)  transaction 
D)  error report

Question 14

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

Accepted Answer

A)  probe 
B)  synonym 
C)  collision 
D)  home

Question 15

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

Accepted Answer

A)  direct 
B)  modulo division 
C)  division remainder 
D)  digit extraction

Question 16

_______ file can be accessed randomly.

Accepted Answer

A)  A sequential 
B)  An indexed 
C)  A hashed 
D)  Any

Question 17

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

Accepted Answer

A)  Collisions 
B)  Buckets 
C)  Synonyms 
D)  Linked lists

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.