1. 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; i. Shortest seek first (SSF) ii. First come first served (FCFS) iii. SCAN assuming the head moves towards 0.
Answers
Answered by
2
Answer:
sd group iti hirrwahsingrauli
Similar questions