edited by
9,659 views
3 votes
3 votes

A disk drive has $100$ cylinders, numbered $0$ to $99$. Disk requests come to the disk driver for cylinders $12, 26, 24, 4, 42, 8$ and $50$ in that order. The driver is currently serving a request at a cylinder $24$. A seek takes $6$ msec per cylinder moved. How much seek time is needed for shortest seek time first (SSTF) algorithm?

  1. $0.984$ sec
  2. $0.396$ sec
  3. $0.738$ sec
  4. $0.42$ sec
edited by

2 Answers

Best answer
4 votes
4 votes
12, 26, 24, 4, 42, 8 and 50

24-26-12-8-4-42-50 sequence of access

Total (2+14+4+4+38+8) *6ms =( 70*6 /1000 )sec

= 420/1000 = 0.42sec
selected by
Answer:

Related questions

3 votes
3 votes
2 answers
2
go_editor asked Jul 30, 2016
11,417 views
A LRU page replacement is used with $4$ page frames and eight pages. How many page faults will occur with the reference string $0172327103$ if the four frames are initial...
1 votes
1 votes
1 answer
4