← Back to 12. File System Implementation

📝 Bit vector Free Space Management

📖 From Operating System • 12. File System Implementation • 9 questions available

Practice MCQs for Bit vector 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. What term describes the condition where free disk space is divided into many small, non‑contiguous pieces?

🔹 A. Internal fragmentation
🔹 B. External fragmentation
🔹 C. Sparse allocation
🔹 D. Block clustering

💡 Difficulty: easy | ✅ Correct: A

Q2. A file system has free holes of sizes 5, 12, 7, and 20 blocks in that order. If a request for 8 blocks arrives, which hole will first‑fit allocate and which hole will best‑fit allocate?

🔹 A. First‑fit: 5; Best‑fit: 7
🔹 B. First‑fit: 12; Best‑fit: 7
🔹 C. First‑fit: 12; Best‑fit: 12
🔹 D. First‑fit: 20; Best‑fit: 12

💡 Difficulty: medium | ✅ Correct: A

Q3. Over time, which allocation strategy tends to produce less external fragmentation, first‑fit or best‑fit, and why does the difference matter for storage utilization?

🔹 A. First‑fit produces less fragmentation because it leaves larger holes untouched.
🔹 B. Best‑fit produces less fragmentation by always using the smallest sufficient hole.
🔹 C. Both produce equal fragmentation; the difference is only in allocation speed.
🔹 D. Best‑fit creates more fragmentation because it splits holes into tiny pieces.

💡 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