Question

Assume that a disk has 50 cylinders with an initial request on cylinder 7. The disk receives new requests for cylinder 1, 30,12,26, 4 and 6 respectively. Graphically represent the scenario using each of the following disk scheduling algorithms;
Shortest seek first (SSF)
First come first served (FCFS)
SCAN assuming the head moves towards 0. (6marks)

Answer 1

Answer:

ycrxf i h ic7txrdib b 0ib z4ez5ezec7cr7r6eez6e6ze5ee5zzw5z5ez5e,55e5ez,6

Explanation:

e6 r 6r r66r r6 ryr6 ry r6 6r r6xr6xf6x6x66rrx6rxdxdy f r66rx6x6 66 6 f

Answer 2

Answer:

is there any one who is writing for exam