Computer Science · Operating Systems
Consider a disk system. The request to access the cylinders occurs in the following sequence: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the head is currently at cylinder 50, what is the total seek time taken to satisfy all requests if it takes 1 ms to move from one cylinder to an adjacent one and Shortest Seek Time First (SSTF) policy is used?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1146 ms
- 2142 ms
- 3120 ms
- 4119 ms✓
Correct answer
119 ms
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