GATE 2011
Which disk scheduling algorithm selects the request that requires the least arm movement from the current cylinder position, potentially leading to starvation of distant requests?
Related Operating Systems PYQs
Let the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes…
A thread is usually defined as a "light weight process" because an operating system (OS) maintains smaller data structures for a t…
In the context of the Critical Section Problem, a solution that satisfies Mutual Exclusion and Progress guarantees that:
Which of the following is NOT one of the four necessary Coffman conditions for a deadlock to occur?
Which of the following CPU scheduling algorithms is inherently non-preemptive?
A context switch between two user-level threads in the same process does NOT require:
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.