Computer Science, asked by kohlimonish, 5 months ago

Disk requests come to the disk driver for cylinders.
4,15, 25, 10, 6, 45, 15, 37 in that order. One seek takes

10 msec per cylinder moved. How much seek time is

needed for.. :

(1) First Come First Serve

(2) Closest cylinder next

(3) Elevator algorithm. (Moving upward)

Note : In all the cases the arm is initially at

cylinder 25.​

Answers

Answered by charanritesh
0

Answer:

Disk requests come to the disk driver for cylinders.

4,15, 25, 10, 6, 45, 15, 37 in that order. One seek takes

10 msec per cylinder moved. How much seek time is

needed for.. :

(1) First Come First Serve

(2) Closest cylinder next

(3) Elevator algorithm. (Moving upward)

Note : In all the cases the arm is initially at

cylinder 25.

Explanation:

Disk requests come to the disk driver for cylinders.

4,15, 25, 10, 6, 45, 15, 37 in that order. One seek takes

10 msec per cylinder moved. How much seek time is

needed for.. :

(1) First Come First Serve

(2) Closest cylinder next

(3) Elevator algorithm. (Moving upward)

Note : In all the cases the arm is initially at

cylinder 25.

Similar questions