Operating SystemTU Board 2021
Suppose that a disk has 200 cylinders (0 200). The head pointer is currently at 50 and previously at 35. The queue of pending request, in FIFO order is: 60, 190, 40, 125, 15, and 150. The time…
5Suppose that a disk has 200 cylinders (0-200). The head pointer is currently at 50 and previously at 35. The queue of pending request, in FIFO order is: 60, 190, 40, 125, 15, and 150. The time required to move per cylinder is 6 msec. Starting from the current head position, what is the total seek time needed to satisfy all the pending request for each of the following disk scheduling algorithms? a) FCFS b) SCAN
A worked answer is on its wayMeanwhile, read the Operating System notes for this topic.
Discussion
Loading…
More Operating System questions
What is a monolithic kernel? How is it different from microkernel? Explain. [1+4]TU Board 20265What is multithreading? Explain different types of threads. [1+4]TU Board 20265Explain the different process states in detail. [5]TU Board 20265What are the necessary conditions for the deadlock? How deadlock is different from starvation? [4+1]TU Board 20265What is segmentation? How can it be used for the memory management? [1+4]TU Board 20265What are different page replacement algorithms? Explain. [5]TU Board 20265