GATE 2006
Which CPU scheduling algorithm is designed to minimize the average waiting time for a given set of processes with known burst times?
Related Operating Systems PYQs
If a parent process terminates without invoking wait() on its child processes, the orphaned child processes are adopted by:
The test-and-set instruction is a hardware primitive primarily used to implement:
The technique of allocating resources to avoid deadlock by ordering all resources linearly and requiring processes to request reso…
Which state of a system ensures that deadlock will never occur under any future resource request sequence?
The scheduling algorithm that suffers from the 'Convoy Effect' is:
A binary semaphore can take only the values:
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.