🏠 Home > Operating System > 10. Mass Storage Structure > Improvement in performance via parallelism
← Back to 10. Mass Storage Structure

📝 Improvement in performance via parallelism

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

Practice MCQs for Improvement in performance via parallelism. 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. What is the primary characteristic of the C‑SCAN disk‑scheduling algorithm?

🔹 A. It moves the arm only to the nearest request and then reverses direction.
🔹 B. It treats cylinders as a circular list, moving in one direction until the end, then jumps to the beginning.
🔹 C. It services requests in the order they arrive, without reordering.
🔹 D. It moves the arm back and forth across the entire disk repeatedly.

💡 Difficulty: easy | ✅ Correct: A

Q2. Given a disk with cylinders 0‑199, head at 53, and request queue 98, 183, 37, 122, 14, 124, 65, 67, which algorithm yields the smaller total head movement?

🔹 A. SCAN
🔹 B. C‑SCAN
🔹 C. Both produce the same total movement
🔹 D. Neither algorithm is suitable for this workload

💡 Difficulty: medium | ✅ Correct: C

Q3. How does employing parallel disks with C‑LOOK scheduling improve overall system performance compared to a single disk using FCFS?

🔹 A. It reduces the average seek distance on each disk, and parallelism multiplies the reduced latency across disks.
🔹 B. It increases the rotational speed of each disk, making FCFS faster.
🔹 C. It allows disks to share the same request queue, eliminating the need for scheduling.
🔹 D. It changes the hardware interface to a faster protocol, independent of scheduling.

💡 Difficulty: hard | ✅ Correct: C

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