Operating Systems - Inode Structure - File Metadata & Block Pointers
When a file size exceeds the capacity of direct block pointers in an inode, which pattern best describes how the file system locates additional data blocks?
When a file size exceeds the capacity of direct block pointers in an inode, which pattern best describes how the file system locates additional data blocks?
easy🔍 Pattern Recognition Q2 of Q15
Step-by-Step Solution
Solution:
Step 1: Recall inode indirect pointer usage
When direct pointers are exhausted, inodes use single, double, and triple indirect pointers forming a multi-level tree structure.Step 2: Evaluate options
Appending direct pointers (B) is not possible as inode size is fixed. File allocation tables (A) are used in FAT file systems, not Unix inodes. Hash maps (D) are not used in inode structures.Final Answer:
Option C -> Option CQuick Check:
Indirect pointers form a tree to extend block addressing [OK]
Quick Trick: Indirect pointers create a tree, not dynamic direct pointers [OK]
Common Mistakes:
MISTAKES- Assuming inode can grow direct pointers dynamically
Trap Explanation:
PITFALL- Candidates confuse inode fixed size with dynamic pointer addition or confuse inode with FAT systems.
Interviewer Note:
CONTEXT- Checks understanding of inode indirect pointer hierarchy for large files.
Master "Inode Structure - File Metadata & Block Pointers" in Operating Systems
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Operating Systems Quizzes