🏠 Home > Operating System > 10. Mass Storage Structure > Swap space management example
← Back to 10. Mass Storage Structure

📝 Swap space management example

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

Practice MCQs for Swap space management example. Test your knowledge with carefully crafted questions across easy, medium, and hard difficulty levels.

🔄 Last updated: 2026-07-26

4
Easy Questions
9
Medium Questions
6
Hard Questions

📝 Sample Questions

Q1. What does the SCAN disk scheduling algorithm do?

🔹 A. It moves the disk arm outward to the highest‑numbered cylinder, then reverses direction and services requests on the way back.
🔹 B. It selects the next request based on shortest seek time.
🔹 C. It services requests in the order they arrive, regardless of head movement.
🔹 D. It only services requests on the outward pass and ignores the return.

💡 Difficulty: easy | ✅ Correct: A

Q2. Which characteristic of C‑SCAN makes its wait‑time distribution more uniform than SCAN?

🔹 A. All requests are serviced in one direction before the head jumps back, eliminating the extra travel for returning requests.
🔹 B. The head reverses direction only after all requests are completed.
🔹 C. C‑SCAN services requests only at the outermost cylinder.
🔹 D. C‑SCAN randomly selects the next request to minimize variance.

💡 Difficulty: medium | ✅ Correct: A

Q3. A disk with 400 cylinders receives requests at cylinders 20, 380, 150, 340, and 50. If the head is at cylinder 200 and the system uses SCAN moving toward lower numbers first, which request is served immediately after the head reaches cylinder 0?

🔹 A. 20
🔹 B. 50
🔹 C. 150
🔹 D. 340

💡 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