Consider the following Graph of disk scheduling and identify the disk…

2025

Consider the following Graph of disk scheduling and identify the disk scheduling algorithm represented by this graph.


Queue: 84, 125, 11, 36, 170, 20, 172, 45

  1. A.

    SSTF

  2. B.

    SCAN

  3. C.

    C-SCAN

  4. D.

    C-LOOK

Attempted by 120 students.

Show answer & explanation

Correct answer: D

This graph represents C-LOOK (Circular LOOK):

  • Directional Service: The head moves in one direction (left to right in the graph, servicing requests like 11, 20, 28, 36, 45, 84, 125, 170, 172).

  • No "End" Travel: Unlike SCAN or C-SCAN, the head does not go all the way to the disk end (0 or 199). It reverses immediately after servicing the last request in the current direction (at 172).

  • Circular Return: After reaching the last request (172), it jumps back to the first request on the other side (11) without servicing any requests during the return trip. This "circular" jump is the defining feature of C-LOOK/C-SCAN.

  • Differentiation:

    • SCAN/C-SCAN would touch the ends (0 or 199).

    • SSTF would zigzag based on the shortest distance, not move in a consistent sweep.

    • C-LOOK services in one direction, jumps back to the start of requests, and repeats, without hitting the physical disk boundaries unnecessarily.

A video solution is available for this question — log in and enroll to watch it.

Explore the full course: Mppsc Assistant Professor