← Back to 12. File System Implementation

📝 Consistency checking and Recovery

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

Practice MCQs for Consistency checking and Recovery. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-27

Easy Questions

Medium Questions

Hard Questions

📝 Sample Questions

Q1. What does FAT stand for?

🔹 A. File Allocation Table

🔹 B. Fixed Allocation Technique

🔹 C. File Access Tracker

🔹 D. Fast Allocation Token

💡 Difficulty: easy | ✅ Correct: A

Q2. How does indexed allocation improve random‑access time compared with linked allocation?

🔹 A. All block pointers are gathered in a single index block, allowing direct calculation of a block's address

🔹 B. It stores pointers in a binary tree that reduces search depth

🔹 C. It compresses pointers to save space, making reads faster

🔹 D. It eliminates the need for a FAT entirely

💡 Difficulty: medium | ✅ Correct: A

Q3. Reading the FAT takes 5 ms and moving to a data block takes 8 ms. What is the total time to read three blocks without caching?

🔹 A. 39 ms

🔹 B. 45 ms

🔹 C. 27 ms

🔹 D. 30 ms

💡 Difficulty: hard | ✅ Correct: D

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