GATE 2014 · session-3
A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is __________.
Related Operating Systems PYQs
Consider the following set of processes with arrival times and CPU burst times: P1: Arrival = 0, Burst = 8 P2: Arrival = 1, Burst …
A computer system uses 46-bit virtual addresses, 32-bit physical addresses, and a page size of 8 KB. What is the number of bits in…
In a Resource Allocation Graph (RAG) with single instances of each resource type, a directed cycle in the graph is:
Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of di…
Which one of the following statements about user-level and kernel-level threads is FALSE?
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, …
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.