Computer Science · Operating Systems
Consider a disk queue with requests for I/O to blocks on cylinders: 84, 125, 11, 36, 170, 20, 172, 45. If the disk head moves continuously in one direction until it reaches the last request in that direction, then reverses direction to service requests going the other way without going to the extreme end of the disk, which disk scheduling algorithm does this trace represent?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1C-LOOK✓
- 2C-SCAN
- 3SCAN
- 4SSTF
Correct answer
C-LOOK
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