Question

)Formulate by assuming the head of a moving disk with 200 tracks, numbered 0….199, is currently serving a request at track 92, and has just finished a request at track 85 and the queue request is kept in the FIFO order, 109, 148, 89, 72, 126, 142. What is the total head movement needed to satisfy these requests for the SCAN,C-SCAN,LOOK and C-LOOK disk scheduling algorithms?

Answer 1

Answer:

mark me the brainliest because I am doing point giveaway and you will get a chance to get the points follow for more updates