In: Accounting
For each of the following file processing operations, indicate whether a sequential file, indexed random file, virtual storage access method, hashing, or pointer structure would work best. You may choose as many as you wish for each step. Also, indicate which would perform the least optimally.
a. Retrieve a record from the file based on its primary key value.
b. Update a record in the file.
c. Read a complete file of records.
d. Find the next record in a file.
e. Insert a record into a file.
f. Delete a record from a file.
g. Scan a file for records with secondary keys.
Access Methods
a. indexed sequential or indexed random; least optimal: sequential
b. indexed random or hashing; least optimal: sequential
c. sequential; least optimal: indexed random
d. sequential or pointer; least optimal; indexed random
e. indexed random or hashing; least optimal: sequential
f. indexed random or hashing; least optimal: sequential
g. indexed random; least optimal: hashing