Consider the following Graph of disk scheduling and identify the disk scheduling algorithm representing by this graph. Queue 84, 125, 11, 36, 170, 20, 172, 45
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. C-LOOK
Explanation
The head services requests in increasing order up to 172, then jumps straight back to the lowest pending request (11) without going to the disk ends, and continues upward. Servicing one direction only and jumping back to the last request is C-LOOK.
More System Software and Operating System questions
- Match the LIST-I with LIST-II RAID ECC D. IV. level 4 organization
- Given the following processes with their times and priority (lower number indicates higher priority) Which of the following is a value of a…
- Calculate the average response time for these processes with nonpreemptive priority Scheduling algorithm? Priority of the process are as fo…
- Match List - I with List - II. (D) Priority Scheduling (IV) Select the process for execution with smallest next Burst time.
- Match List - I with List - II.
- What is the significance of the Banker's algorithm in terms of resource management?