← Back to 12. File System Implementation

📝 Backup and restore in Recovery

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

Practice MCQs for Backup and restore in 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 in file systems?

🔹 A. File Allocation Table

🔹 B. Fast Access Technique

🔹 C. File Access Tracker

🔹 D. Fragmented Allocation Table

💡 Difficulty: easy | ✅ Correct: B

Q2. Why does indexed allocation allow faster direct access than linked allocation?

🔹 A. All block addresses are stored together in an index block

🔹 B. It uses a hash table for block lookup

🔹 C. It stores blocks contiguously on disk

🔹 D. It eliminates the need for a directory

💡 Difficulty: medium | ✅ Correct: B

Q3. How does caching the FAT reduce the number of disk‑head seeks, and what trade‑off does this introduce?

🔹 A. Reduces seeks but increases CPU usage

🔹 B. Reduces seeks by keeping the FAT in memory, at the cost of using RAM

🔹 C. Eliminates seeks entirely, but requires SSD

🔹 D. Caches the data blocks, not the FAT

💡 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