Computer Science · Operating Systems
Consider a disk with 1000 cylinders numbered from 0 to 999. The disk arm is currently at cylinder 300 and moving towards cylinder 800. If there are pending requests at cylinders 350, 780, 200, 900, 600 and 480, which disk scheduling algorithm will result in the lowest variance of seek time?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1C-SCAN✓
- 2LOOK
- 3SCAN
- 4C-LOOK
Correct answer
C-SCAN
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Operating Systems MCQs →Want more practice questions on Operating Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Operating Systems