$1.$ Given that you have a $50$ track disc $(0-49).$ Also given that it takes $1$ ms to travel from one track to

the next, and that the head is originally positioned at Track $20$ and moving inwards. Using the seek

strategies below, illustrate how the following requests would be serviced, all requests are present

in the wait queue and arrived in the order from left to right, ignore rotational time and transfer

time: $10,22,20,2,40,6,38.$

a$.$ FCFS

b$.$ SSTF

c$.$ SCAN

d$.$ LOOK

e$.$ C$-$SCAN

f$.$ C$-$LOOK

$2.$ Consider a $5$ tracks and $5$ sectors per track virtual cylinder with the following characteristics: seek

time is $4$ ms$/$track$,$ search time is $1\mathrm{.}7$ ms$/$sector$,$ and data transfer time is $0\mathrm{.}6$ ms$.$ Calculate the

resulting seek time, search time, data transfer time, and total time for the following Request List,

assuming that the read$/$write head begins at Track $0,$ Sector $0.$ Finally, calculate the total time

required to meet all of these requests.

Track Sector Seek Time Search Time Data Transfer

Time

Total Time

$00($Starting

Place$)$

$10$

$14$

$10$

$31$

$24$

$30$