🏠 Home > Operating System > 12. File System Implementation > Counting Free Space Management
← Back to 12. File System Implementation

📝 Counting Free Space Management

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

Practice MCQs for Counting 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, noncontiguous pieces?

🔹 A. External fragmentation
🔹 B. Internal fragmentation
🔹 C. File locking
🔹 D. Disk mirroring

💡 Difficulty: easy | ✅ Correct: A

Q2. Why is the first‑fit allocation algorithm generally faster than best‑fit when searching for a free hole?

🔹 A. It scans the entire free list each time
🔹 B. It stops at the first hole that is large enough
🔹 C. It sorts holes by size before searching
🔹 D. It uses a hash table to locate holes

💡 Difficulty: medium | ✅ Correct: B

Q3. Three files of sizes 6 KB, 4 KB, and 8 KB are allocated sequentially using first‑fit on a disk that initially has a single free hole of 20 KB. After the allocations, the files are deleted in the order 6 KB, 8 KB, 4 KB. Which allocation strategy would most likely reduce the external fragmentation that results?

🔹 A. Worst‑fit
🔹 B. Next‑fit
🔹 C. Best‑fit
🔹 D. Random‑fit

💡 Difficulty: hard | ✅ Correct: C

⬆️ 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