GATE 2008
Which scheduling algorithm assigns CPU priority inversely proportional to the process's burst time?
Related Operating Systems PYQs
A counting semaphore S is initialized to 7. Then, 20 P (wait) operations and 15 V (signal) operations are performed on S. What is …
External fragmentation in an operating system can be resolved using:
Which of the following disk head scheduling algorithms services requests in a circular direction, moving from one end of the disk …
In demand paging, a page fault occurs when:
Which of the following IPC mechanisms allows bi-directional communication between unrelated processes across a local system or net…
In a virtual memory system, the memory access time is 20 ns and page fault service time is 10 ms (10,000,000 ns). If the allowable…
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.