Operating Systems - File Allocation Methods - Contiguous, Linked, Indexed
In a file system using indexed allocation with a single-level index block, how is the file managed when its size surpasses the index block's capacity?
In a file system using indexed allocation with a single-level index block, how is the file managed when its size surpasses the index block's capacity?
medium🧾 Trace Q4 of Q15
Step-by-Step Solution
Solution:
Step 1: Understand single-level indexed allocation
The index block contains pointers to all file blocks but has fixed size.Step 2: When file size exceeds index capacity
No more pointers can be stored; the system cannot allocate additional blocks without extending the indexing scheme.Step 3: Addressing the limitation
Multi-level or combined indexing schemes are required to handle larger files.Final Answer:
Option C -> Option CQuick Check:
Single-level index block has fixed pointer capacity [OK]
Quick Trick: Single-level index blocks have fixed size; multi-level needed for large files [OK]
Common Mistakes:
MISTAKES- Assuming index blocks can dynamically grow
- Believing the system switches allocation methods automatically
- Thinking files are split automatically without user intervention
Trap Explanation:
PITFALL- Option C seems plausible but index blocks have fixed size; dynamic expansion is not typical.
Interviewer Note:
CONTEXT- Tests knowledge of indexed allocation limits and file size management.
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