🏠 Home > Operating System > 10. Mass Storage Structure > C SCAN scheduling in Disk Scheduling
← Back to 10. Mass Storage Structure

📝 C SCAN scheduling in Disk Scheduling

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

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

🔄 Last updated: 2026-07-26

1
Easy Questions
5
Medium Questions
2
Hard Questions

📝 Sample Questions

Q1. What does the C‑SCAN disk‑scheduling algorithm stand for?

🔹 A. Circular SCAN
🔹 B. Constant Scan
🔹 C. Concurrent Scan
🔹 D. Cylindrical Scan

💡 Difficulty: easy | ✅ Correct: A

Q2. How does C‑SCAN differ from the traditional SCAN algorithm after the disk arm reaches the highest‑numbered request?

🔹 A. It reverses direction and services lower‑numbered requests immediately.
🔹 B. It continues in the same direction, jumps to the lowest cylinder, and resumes servicing.
🔹 C. It stops and waits for new requests before moving again.
🔹 D. It randomly selects the next request regardless of cylinder order.

💡 Difficulty: medium | ✅ Correct: B

Q3. A disk has cylinders 0–199. Requests are at 40, 10, 70, 130, 160, and 190. The head starts at 120 and moves upward. What is the total distance the head travels under C‑SCAN?

🔹 A. 338
🔹 B. 300
🔹 C. 280
🔹 D. 250

💡 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