GATE 1993
Four processes P1, P2, P3, P4 arrive at time 0 with burst times 5, 3, 8, 6 ms. What is the average waiting time under non-preemptive Shortest Job First (SJF) scheduling in ms?
Related Operating Systems PYQs
In the Bounded-Buffer problem implemented using semaphores, what are the initial values of semaphores 'mutex', 'empty', and 'full'…
The Bakery algorithm by Leslie Lamport is designed to solve the critical section problem for:
In an operating system with linked allocation for files, random direct access to a specific disk block within a file requires:
In a Resource Allocation Graph, a directed edge from a process node Pi to a resource node Rj (Pi -> Rj) represents:
Which deadlock recovery strategy involves terminating all deadlocked processes simultaneously?
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
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.