3,552 views
0 votes
0 votes
Suppose that the head of a moving head disk with 192 tracks(0-191), is currently serving a request at track 80 and has just finished at track 62. The queue of the request is kept in FIFO order: 119, 58, 114, 28, 111, 55, 103, 30, 75. What is the total no of tracks traversed by head movements needed to satisfy these request for the Elevator disk-scheduling algorithm?

a. 143

b. 130

c. 177

d. 547

1 Answer

0 votes
0 votes

Actual answer:

80--->103--->111--->114--->119--->191--->75--->58--->55--->30--->28

Head Movements = (191-80) + (191-28) = 274. (Correct Answer)

What they considered:

80--->103--->111--->114--->119--->75--->58--->55--->30--->28

Head Movements = (119-80) + (119-28)  = 130.   , here, option (b)  is correct.(Acc. to them)

edited by

Related questions

1 votes
1 votes
0 answers
3
jatin khachane 1 asked Dec 11, 2018
1,124 views
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6...
0 votes
0 votes
0 answers
4
Astitva Srivastava asked Dec 3, 2018
788 views
How does LOOK algorithm decides that this is the last request? What technique is used to determine that after this request, instead of going to the end of disk, the direc...