0
4.2kviews
Perform the computation for following scheduling algorithm :- (i) FIFO (ii) SSTF (iii) SCAN (iv) C-SCAN
written 6.4 years ago by | modified 2.1 years ago by |
On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all requests in the disk queue. Assume the last request serviced was at track 345 and the head is moving towards track 0, the queue in FIFO order contains requests for the following tracks:
123,874,692,475,105,376
Perform the computation for the following scheduling algorithm:-
(i) FIFO (ii) SSTF (iii) SCAN (iv) C-SCAN
ADD COMMENT
EDIT
1 Answer