operating system

DISK SCHEDULING Given the following disk access schedule in terms of the cylinder number compute the seek-distance by using SSTF (shortest seek-time first), and the C-SCAN algorithms. Assume that there are 100 cylinders in total; the current position of the head is 80; the current head movement is downwards (higher to lower cylinder number) Access String: 65, 78, 50, 15, 65, 95, 20, 85 1