Follow Us :

Nov2017 cs Q35

0. In __________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip.

  • Option : D
  • Explanation :
    In C-SCAN disk scheduling algorithm, the disk head serve the request from one end to other end but when it reaches to other end it immediately returns to the starting of the disk without serving any request.
    So option (D) is correct.
Cancel reply
Cancel reply