← Back to 12. File System Implementation

πŸ“ Space maps Free Space Management

πŸ“– From Operating System β€’ 12. File System Implementation β€’ 9 questions available

Practice MCQs for Space maps Free Space Management. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

πŸ”„ Last updated: 2026-07-27

2
Easy Questions
4
Medium Questions
3
Hard Questions

πŸ“ Sample Questions

Q1. A file begins at disk block 120. To directly access the 7th block of the file, which disk block address must be read?

πŸ”Ή A. 127
πŸ”Ή B. 128
πŸ”Ή C. 126
πŸ”Ή D. 125

πŸ’‘ Difficulty: easy | βœ… Correct: A

Q2. Given free holes of sizes 10, 8, 20, and 6 blocks (in that order) and a request for 7 blocks, which allocation algorithm will leave the smallest amount of unused space after allocation?

πŸ”Ή A. First fit
πŸ”Ή B. Best fit
πŸ”Ή C. Worst fit
πŸ”Ή D. Next fit

πŸ’‘ Difficulty: medium | βœ… Correct: B

Q3. A file needs 35 contiguous blocks but the largest free chunk is only 30 blocks. Which allocation method can store the file without requiring defragmentation?

πŸ”Ή A. Linked allocation
πŸ”Ή B. Contiguous allocation
πŸ”Ή C. Indexed allocation
πŸ”Ή D. Multi‑level indexing

πŸ’‘ Difficulty: hard | βœ… Correct: A

⬆️ View all questions in the quiz below

πŸ”— Related Topics

πŸ“ File System Structure in operating systemπŸ“ Overview of File System Implementation in Operating SystemπŸ“ Partitions and mounting in File System ImplementationπŸ“ Virtual File Systems in File System ImplementationπŸ“ Linear list Implementation in Directory
πŸš€ Start Quiz πŸ“ Practice Mode