When the storage allocation table uses ____ data structures sequential file access is very efficient but random access is much less efficient.
A) linked lists
B) B+ trees
C) binary trees
D) hash tables

Question

Quizplus · Accepted Answer

Linked lists are efficient for sequential access because elements are connected in a linear order, but they are less efficient for random access since you have to traverse the list from the beginning to reach a specific element.

When the Storage Allocation Table Uses ____ Data Structures Sequential