GATE 2001
A CPU scheduling algorithm allocates the CPU to the process that has been waiting the longest in the ready queue. This algorithm is known as:
Related Operating Systems PYQs
The short-term scheduler (CPU scheduler) selects a process from among the processes that are:
A paging system uses 12-bit logical addresses with a page size of 256 bytes. What is the maximum number of pages in the logical ad…
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
Consider a system consisting of k instances of a resource R, being shared by 5 processes. Assume that each process requires a maxi…
Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a phys…
Consider a hard disk with a rotational speed of 15000 rpm. The time to move the read/write head from a track to its adjacent track…
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.