3. Run the C-LOOK algorithm (requests can only be serviced when the head is moving toward higher numbered tracks); the head is c
urrently at location 50, heading toward 0. Give the order in which the following requests will be serviced and compute the total distance that the disk head must travel to service all the requests (the highest location allowed for the head is 100): 12, 20, 22, 30, 44, 55, 61, 65, 68, 70, 71, 72, 80, 93.
1 answer:
You might be interested in
