GATE 1992
A system uses Round Robin scheduling with quantum = 3 ms. Process P1 arrives at time 0 with burst 8 ms. How much time does P1 spend waiting in the ready queue before completing execution (assuming no other processes)?
Related Operating Systems PYQs
A system has 4 processes and 6 identical instances of a resource type. What is the maximum number of resources each process can re…
In disk systems, rotational latency is on average equal to:
An unsafe state in deadlock avoidance implies:
A system uses a 32-bit virtual address and 8 KB pages. How many bits are used for the virtual page offset?
A Round Robin scheduler has time quantum q = 2 ms. A single process with CPU burst 7 ms arrives at time 0. At what time (in ms) do…
The Optimal page replacement algorithm minimizes page faults by evicting the page that:
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.