Which of the following file structures is most efficient in cases in which the file is always processed in its entirety a predetermined order?
A) Sequential
B) Indexed
C) Hash

Question

Quizplus · Accepted Answer

In a sequential file structure, the data is stored in a predetermined order and can be accessed in the same order. Since the file is always processed in its entirety in a predetermined order, a sequential file structure would be the most efficient choice as it allows for sequential access to the data without the need for additional indexes or hash tables. Indexed and hash file structures would be more beneficial in cases where random access to the data is required.

Which of the Following File Structures Is Most Efficient in Cases