GATE 2000
Which disk head scheduling algorithm services requests on the way across the disk and reverses immediately without traveling to the absolute boundary if no further requests exist in that direction?
Related Operating Systems PYQs
The Banker's algorithm is an example of:
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
Consider a system consisting of k instances of a resource R, being shared by 5 processes. Assume that each process requires a maxi…
Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a phys…
Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track…
Consider the following program snippet. Assume that the program compiles and runs successfully. Further, assume that the fork() sy…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.