Complete the code to describe the direction of the disk arm in C-SCAN.
The disk arm moves in one direction until it reaches the end, then it [1] to the beginning.
In C-SCAN, the disk arm moves in one direction and when it reaches the end, it jumps back to the beginning without servicing requests on the return.
Complete the code to explain the main advantage of C-SCAN over SCAN.
C-SCAN provides a more uniform wait time by servicing requests in a [1] direction only.
C-SCAN services requests in a single direction only, which helps provide a more uniform wait time compared to SCAN that moves back and forth.
Fix the error in the description of C-SCAN's movement.
In C-SCAN, the disk arm moves from the start to the end and then [1] back servicing requests on the return.
C-SCAN moves the arm from start to end servicing requests, then jumps back to the start without servicing requests on the return.
Fill both blanks to complete the C-SCAN algorithm description.
C-SCAN moves the disk arm from [1] to [2], servicing requests only in this direction.
C-SCAN moves the disk arm from the start to the end of the disk, servicing requests only in this direction before jumping back.
Fill all three blanks to complete the C-SCAN scheduling code snippet.
requests = sorted(requests) current_pos = [1] for req in requests: if req >= current_pos: service(req) current_pos = [2] for req in requests: if req < current_pos: service(req) current_pos = [3]
The C-SCAN algorithm starts servicing requests from the current position (0), moves to the max track, then jumps back to 0 to service remaining requests.