← Bitkernel Interview Insights
First, clarify that the question asks for the least suitable structure for efficient random access. Then, evaluate each option based on its access pattern: sequential/contiguous and indexed allow direct access, hash allows O(1) average access, while linked requires traversal. Conclude that linked is the answer and explain why.
Pro tip: Mention that while linked allocation is poor for random access, it excels in sequential access and file growth, showing you understand trade-offs. Also, note that real systems often use hybrid approaches like indexed allocation with linked blocks.
Restate that the goal is efficient random access to records, meaning we want to minimize disk I/O and seek time when accessing arbitrary records.
For each option, describe how random access is performed: sequential/contiguous uses direct offset calculation, indexed uses an index block, hash uses a hash function, and linked requires traversing pointers.
State the time complexity for random access: O(1) for contiguous and hash, O(1) or O(log n) for indexed, and O(n) for linked.
Conclude that linked allocation is not suitable because it requires sequential traversal from the start to reach a specific record, making random access inefficient.
Briefly mention that linked allocation is beneficial for sequential access and file growth, but for random access, other structures are preferred.
AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.