GATE 1990
Which scheduling algorithm assigns CPU to processes in strict order of arrival without preemption?
Related Operating Systems PYQs
Which memory management concept loads a page into physical memory only when it is actually referenced during execution?
Peterson's algorithm is a software-based solution that solves the critical section problem for:
The C-SCAN (Circular SCAN) disk scheduling algorithm differs from standard SCAN in that C-SCAN:
In operating systems, a thread shares which of the following resources with other peer threads belonging to the same process?
A critical section is a program segment where:
In Unix, a zombie process is a process that has:
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.