Q99.Marks: +2.0UGC NET Paper 2: Computer Science and Application 26th June 2025 Shift 1
📄 Passage
Consider the following disc Queue with requests for I/O to block on cylinders:
45, 81, 185, 33, 175, 99, 150, 77
(Consider that the head starts from location 58)
What shall be the 2nd request being processed by C-LOOK (Right) disc Scheduling technique for the already given request queue?
1.81✓ Correct
2.45
3.77
4.33
Solution
Given
Queue: 45, 81, 185, 33, 175, 99, 150, 77
Head starts at 58
Policy: C-LOOK (Right) → move only to higher cylinder numbers; after the largest serviced request, wrap around to the smallest pending request (jump, no service during the jump), then continue to the right again.
Sort once by cylinder
Sorted list: 33, 45, 77, 81, 99, 150, 175, 185
Split relative to head (58):
Right side (≥ 58): 77, 81, 99, 150, 175, 185
Left side (< 58): 33, 45
C-LOOK (Right) service order
Serve the right side in ascending order: 77 → 81 → 99 → 150 → 175 → 185
Wrap (circular jump) to the smallest pending request and continue ascending: 33 → 45
So the overall service order is: 77, 81, 99, 150, 175, 185, 33, 45