Operating Systems - File Allocation Methods - Contiguous, Linked, Indexed
Which of the following statements about linked file allocation is INCORRECT?
Which of the following statements about linked file allocation is INCORRECT?
medium🐞 Bug Identification Q14 of Q15
Step-by-Step Solution
Step 1: Recall linked allocation properties
Linked allocation stores file blocks non-contiguously with pointers linking blocks sequentially.Step 2: Analyze linked allocation eliminates external fragmentation by allowing non-contiguous storage
Correct: linked allocation avoids external fragmentation by allowing scattered blocks.Step 3: Analyze linked allocation supports efficient direct access to any block in the file
Incorrect: linked allocation does not support efficient direct access; it requires sequential traversal.Step 4: Analyze each file block contains a pointer to the next block in the chain
Correct: each block contains a pointer to the next.Step 5: Analyze linked allocation requires only the starting block address to access the entire file
Correct: only the starting block address is needed to traverse the file.Final Answer:
Option B -> Option BQuick Check:
Linked allocation -> no efficient direct access, only sequential traversal.
Quick Trick: Linked allocation -> sequential access only, no direct access [OK]
Common Mistakes:
MISTAKES- Assuming linked allocation supports direct access
- Confusing external fragmentation with internal fragmentation
Trap Explanation:
PITFALL- Option B is tempting because candidates often confuse linked allocation with indexed allocation which supports direct access.
Interviewer Note:
CONTEXT- Tests candidate's ability to spot misconceptions about linked allocation.
Master "File Allocation Methods - Contiguous, Linked, Indexed" in Operating Systems
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Operating Systems Quizzes