A. Suppose the following disk request sequence (track numbers) for a disk with 200 tracks is given: 95, 180, 34, 119, 11, 123, 62, 64. Assume that the initial position of the R/W head is on track 50. Which of the following algorithms is better in terms of the total head movements for each algorithm? First Come -First Serve (FCFS) Shortest Seek Time First (SSTF) algorithm B. Suggest and discuss two disk scheduling algorithms for the systems that place a heavy load on the disk. Give the reason.

Suppose that we want to schedule disk requests on a disk containing 200 cylinders numbered from 0 to 199. The Disk requests to be addressed are 82,170,43,140,24,16,189. And the Read/Write arm is at 48, and it is also given that the disk arm should move "towards the larger value". Q₁- Illustrate on a graph the total read/write head movement for the SCAN Disk scheduling algorithm. Q2- Calculate the total overhead movement (total distance covered by the disk arm).

Consider a disk subjected to I/O requests arriving (following Poisson distribution) at an average rate of  requests/second. Assume that on average, there were 5 requests waiting for service in the queue and that each request waits in the queue for about 10 milliseconds, on average. What is the effective arrival rate  for this disk?

Using the following Disk Scheduling algorithm, calculate the total number of head movements to serve the working queue given below: a)First come, first serve (FCFC)b)Shortest seek time first (SSTF)c)SCAN  Work Queue: 22, 88, 131, 41, 189.There are 200 cylinders numbered from 0 - 199.The disk head stars at number 100.