NOTE:

plss DO IT IN 45MINs plsss i will give UPVOTE definetly!!!

its OPERATING SYSTEM theory question

plss do it in 45mins whatever you completed in 45mins you can send it. ITS VERY IMPORTANT!!

you can decrease steps or whatever to send it on time!!!!

Suppose that a disk drive has 2000 cylinders, numbered 0 to 1999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests using the following disk scheduling algorithms (Consider service from left to right)? a. SCAN b. LOOK algorithm. (5 marks each)