Chapter 13.2 File Organisation and File Access

Which of the following is a characteristic of serial file organisation?

• Records are stored in key field order.

• Records are stored in the order they were added.

• Records can be accessed directly using a hashing algorithm.

• Records must be indexed to be accessed.

A payroll system processes employee records in ascending employee ID order every month. Which method of file organisation is most suitable?

• Serial

• Sequential

• Random

• Direct

Which of the following file access methods is most appropriate when all records in a file must be processed?

• Direct access

• Indexed access

• Sequential access

• Random access

A hashing algorithm generates the same storage address for two different key values. This situation is called:

• Overflow

• Clustering

• Collision

• Chaining

Which file organisation method always requires a hashing algorithm to calculate record addresses?

• Serial

• Sequential

• Random

• Indexed Sequential

A hash function is defined as: Address = Key MOD 100. What is the storage address for a record with key value 457?

• 4

• 45

• 57

• 100

Which file access method is typically used with random file organisation?

• Sequential

• Direct

• Indexed

• Serial

Which of the following is a disadvantage of sequential file organisation?

• It requires a hashing algorithm.

• Records cannot be accessed directly.

• It cannot store records in order.

• Records cannot be processed sequentially.

Which solution is used to handle collisions by setting up an overflow area?

• Open hashing

• Closed hashing

• Key compression

• Hash doubling

A log file stores events in the order they occur. Which file organisation and access method is most appropriate?

• Serial organisation with sequential access

• Sequential organisation with direct access

• Random organisation with direct access

• Sequential organisation with sequential access