← Back to 10. Mass Storage Structure

📝 SSTF scheduling in Disk Scheduling

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

Practice MCQs for SSTF scheduling in Disk Scheduling. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-26

2
Easy Questions
4
Medium Questions
3
Hard Questions

📝 Sample Questions

Q1. The disk arm is currently at cylinder 45. Pending requests are for cylinders 10, 22, 48, 70, and 90. Which request will the SSTF algorithm select next?

🔹 A. 10
🔹 B. 22
🔹 C. 48
🔹 D. 70

💡 Difficulty: easy | ✅ Correct: C

Q2. SSTF scheduling primarily attempts to reduce which component of disk access time?

🔹 A. Seek time
🔹 B. Rotational latency
🔹 C. Data transfer time
🔹 D. Queueing delay

💡 Difficulty: medium | ✅ Correct: A

Q3. A disk head is at cylinder 50. The request sequence is 95, 180, 34, 119, 11, 123. Which algorithm results in less total head movement?

🔹 A. SSTF
🔹 B. FCFS
🔹 C. Both equal
🔹 D. Neither

💡 Difficulty: hard | ✅ Correct: A

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