🏠 Home > Operating System > 10. Mass Storage Structure > Selection of a disk scheduling algorithm
← Back to 10. Mass Storage Structure

📝 Selection of a disk scheduling algorithm

📖 From Operating System • 10. Mass Storage Structure • 22 questions available

Practice MCQs for Selection of a disk scheduling algorithm. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-26

4
Easy Questions
11
Medium Questions
7
Hard Questions

📝 Sample Questions

Q1. What is the definition of seek time in a magnetic disk?

🔹 A. Time for the head to move to the target cylinder
🔹 B. Time for the disk to rotate to the target sector
🔹 C. Time to transfer data between disk and memory
🔹 D. Time for the controller to acknowledge the request

💡 Difficulty: easy | ✅ Correct: A

Q2. Given a current head at cylinder 50 and pending requests at 10, 22, 40, 58, and 60, which algorithm yields the smallest total head movement?

🔹 A. FCFS
🔹 B. SSTF
🔹 C. SCAN
🔹 D. C‑SCAN

💡 Difficulty: medium | ✅ Correct: B

Q3. Why can the SSTF algorithm cause starvation for some requests?

🔹 A. It always selects the nearest request
🔹 B. It ignores requests that are far from the current head position
🔹 C. It rotates the head continuously
🔹 D. It assigns priority based on process ID

💡 Difficulty: hard | ✅ Correct: B

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