← Back to 10. Mass Storage Structure

πŸ“ Stable Storage Implementation

πŸ“– From Operating System β€’ 10. Mass Storage Structure β€’ 14 questions available

Practice MCQs for Stable Storage Implementation. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

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

4
Easy Questions
6
Medium Questions
4
Hard Questions

πŸ“ Sample Questions

Q1. A disk scheduler receives the request queue {98, 183, 37, 122, 14, 124, 65, 67} and the head is currently at cylinder \(53\). Using the C‑LOOK algorithm, which cylinder will be serviced next?

πŸ”Ή A. 65
πŸ”Ή B. 67
πŸ”Ή C. 14
πŸ”Ή D. 98

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

Q2. A server experiences a high volume of random disk requests, causing frequent head starvation with SSTF. Which scheduling algorithm is most likely to prevent starvation while maintaining good throughput?

πŸ”Ή A. FCFS
πŸ”Ή B. SSTF
πŸ”Ή C. SCAN
πŸ”Ή D. LOOK

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

Q3. Given the request queue {98, 183, 37, 122, 14, 124, 65, 67} and a head starting at cylinder \(53\), what is the total number of cylinders the head moves under C‑LOOK (excluding the wrap‑around jump)?

πŸ”Ή A. 145
πŸ”Ή B. 150
πŸ”Ή C. 158
πŸ”Ή D. 153

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

⬆️ View all questions in the quiz below

πŸ”— Related Topics

πŸ“ Magnetic disksπŸ“ Solid state disksπŸ“ Magnetic tapesπŸ“ Disk StructureπŸ“ Host attached storage
πŸš€ Start Quiz πŸ“ Practice Mode