Match the following : \(\begin{array}{clcl} \text{} & \textbf{List – I} &&…
2014
Match the following :
\(\begin{array}{clcl} \text{} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{Contiguous allocation} & \text{i.} & \text{This scheme supports very large}\\&&& \text{ file sizes.} \\ \text{b.} & \text{Linked allocation} & \text{ii.} & \text{This allocation technique supports} \\ &&& \text{ only sequential files.} \\ \text{c.} & \text{Indexed allocation} & \text{iii.} & \text{The number of disks required to} \\&&&\text{access file is minimal.} \\ \text{d.} & \text{Multi-level indexed} & \text{iv.} & \text{This technique suffers from maximum} \\ &&&\text{wastage of space in storing pointers.} \\ \end{array}\)
Codes :
- A.
a-iii; b-iv; c-ii; d-i
- B.
a-iii; b-ii; c-iv; d-i
- C.
a-i; b-ii; c-iv; d-iii
- D.
a-i; b-iv; c-ii; d-iii
Attempted by 134 students.
Show answer & explanation
Correct answer: B
Correct matching with brief explanations:
Contiguous allocation → The number of disks required to access the file is minimal. Rationale: the file occupies consecutive blocks on disk, reducing seeks and allowing efficient sequential and random access.
Linked allocation → This allocation technique supports only sequential files. Rationale: each block contains a pointer to the next block, so traversal is sequential and random access is inefficient.
Indexed allocation → This technique suffers from maximum wastage of space in storing pointers. Rationale: an index block (or blocks) stores pointers to file blocks; for many files the pointer storage can be large relative to data.
Multi-level indexed → This scheme supports very large file sizes. Rationale: multiple levels of indexing allow addressing a much larger number of blocks without a single huge index block.
A video solution is available for this question — log in and enroll to watch it.