GATE 2009
In a Round-Robin CPU scheduling algorithm with time quantum q, what happens as q becomes arbitrarily large (q -> ∞)?
Related Operating Systems PYQs
Which of the following statements is/are true? I. Shortest remaining time first scheduling may cause starvation II. Preemptive sch…
Belady's anomaly refers to the phenomenon where:
In the Producer-Consumer problem solved using semaphores, what is the purpose of the binary semaphore 'mutex' initialized to 1?
The Working Set model of process execution is used by an operating system to prevent:
Which of the following is true regarding deadlock detection and recovery?
Which of the following conditions is violated when a system allows preempting resources from a process holding them if another hig…
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.