📝 SCAN scheduling in Disk Scheduling

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

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

🔄 Last updated: 2026-07-26

Easy Questions

Medium Questions

Hard Questions

📝 Sample Questions

Q1. What is the primary characteristic of the SCAN disk‑scheduling algorithm?

🔹 A. It serves requests in the order they arrive, without reordering

🔹 B. It moves the disk arm back and forth across the cylinder range, servicing requests in one direction before reversing

🔹 C. It always jumps to the furthest request then returns to the start

🔹 D. It selects the request with the shortest seek distance

💡 Difficulty: easy | ✅ Correct: B

Q2. Why does the SCAN algorithm typically produce less variance in request waiting times than FCFS?

🔹 A. Because it always chooses the nearest request, leading to minimal movement

🔹 B. Because it groups requests by cylinder, reducing rotational latency only

🔹 C. Because it sweeps across the cylinder range in a predictable pattern, preventing long gaps between services

🔹 D. Because it ignores request order, causing equal wait times for all requests

💡 Difficulty: medium | ✅ Correct: C

Q3. Given an initial head position of 50 moving outward, and pending requests at cylinders 10, 22, 38, 43, 55, 73, 84, and 95, what is the average seek distance per request under SCAN (max cylinder 200)?

🔹 A. 42.5 cylinders

🔹 B. 45.0 cylinders

🔹 C. 40.0 cylinders

🔹 D. 38.0 cylinders

💡 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