GATE 1988
Which scheduling algorithm is non-preemptive and selects the process with the smallest CPU burst time?
Related Operating Systems PYQs
A process has CPU burst time 10 ms and arrival time 0 ms. If its turnaround time is 15 ms, what was its total waiting time in ms?
Internal fragmentation is a characteristic phenomenon observed in:
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.