Scribd
Upload
74 views1 page

Numericals On Unit 6

Uploaded by

Manas Kagankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views1 page

Numericals On Unit 6

Uploaded by

Manas Kagankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Q. 1 Disk request come in to the driver for cylinder 10,22,20,2,40,6 and 38.

A seek takes 6 msec


per cylinder moved. How much seek time needed for FCFS, Closet cylinder next diagram. Initially
arm is at cylinder 20. Starting track at 100. The queue of pending request is,
27,129,110,186,147,41,10,63,120 – FIFO, SSTF, SCAN, C-SCAN, Look, C-LOOK.
Q. 2 Suppose that a disk drive has 5000 cylinders, numbered 0 through 4999.The drive is serving
a request at cylinder 143. FIFO order is, 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 starting
from head position. What is total distance? FCFS, SSTF, SCAN, LOOK, C SCAN, C-LOOK.
Q. 3 Suppose that a disk drive has 200 Cylinders, numbered 0 to 199. Queue = 98, 183, 41, 122,
14, 124, 65, 67. The drive is currently serving a request at cylinder 54 and the previous request
was at cylinder 20. Find total number of head movements needed to satisfy the requests for the
FIFO, SSTF, SCAN, C-SCAN, Look, C-LOOK disk scheduling algorithm?
Q. 4 We assume a disk with 200 tracks and disk request queue in it. The requested tracks in the
order by disk scheduler are 55,58,39,18,90,160,150,38,184. Starting track at 100. Calculate
average seek length using FIFO, SSTF, SCAN, C-SCAN, Look, C-LOOK. Give which disk
scheduler is best for this scenario.
Q. 5 Suppose that a disk drive has 1000 cylinders, numbered 0 to 999. Assume last request received
was at track 345 and the head is moving towards track 0. The queue of pending requests, in FIFO
order, is 123,874,692,475,105,367. Perform following scheduling algorithm FIFO, SSTF, SCAN,
C-SCAN, Look, C-LOOK.
Q. 6 Suppose a disk has 200 tracks (0-199). The request sequence (82,170,43,140,24,16,190) and
the head position is at 50. Find total number of head movements needed to satisfy the requests for
the FIFO, SSTF, SCAN, C-SCAN, Look, C-LOOK disk scheduling algorithm? Give which disk
scheduler is best for this scenario.
Q. 7 Suppose the order of requests are 70, 140, 50, 125, 30, 25, 160 and the initial position of the
Read-Write head is 60. Find total number of head movements needed to satisfy the requests for
the FIFO, SSTF, SCAN, C-SCAN, Look, C-LOOK disk scheduling algorithm? Give which disk
scheduler is best for this scenario.
Q. 8 Suppose a disk has 200 tracks (0-199). The request sequence (176, 79, 34, 60, 92, 11, 41, 114)
and the head position is at 50. Find total number of head movements needed to satisfy the requests
for the FIFO, SSTF, SCAN, C-SCAN, Look, C-LOOK disk scheduling algorithm? Give which
disk scheduler is best for this scenario.

You might also like