Consider the following disk-scheduling movement and identify the algorithm it represents. Request queue: 84, 125, 11, 36, 170, 20, 172, 45 (cylinders 0–199). The head starts at cylinder 28 and services 36 → 45 → 84 → 125 → 170 → 172 moving towards higher cylinders, then jumps directly back to 11 (without going to 199 or 0) and services 11 → 20.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: D. C-LOOK
Explanation
The head serves requests in one direction only, goes only as far as the last request (172, not 199), and then jumps back to the lowest pending request (11, not 0) and continues in the same direction. That is C-LOOK. SSTF would serve 36 then 20, 11 first; SCAN/C-SCAN would travel to the disk end.More System Software and Operating System questions
- Match List I with List IIList I List II A. RAID level 1 I. Bit-interleaved parity organization B. RAID level 2 II. Disk mirroring C. RAID l…
- If the virtual memory size is 32 MB and the physical memory size is 4 MB with a page size of 2 KB, calculate the number of frames available…
- Which of the following does NOT interrupt a running process?
- Given the following processes with their burst times and priorities (lower number indicates higher priority), all arriving at time 0, what…
- Calculate the average response time for these processes with the non-preemptive priority scheduling algorithm. Priorities are as follows; c…
- Find the average weighted turnaround time for these processes using the Highest Response Ratio Next (HRN) algorithm.