GATE 1992
A system has 4 processes and 6 identical instances of a resource type. What is the maximum number of resources each process can request such that deadlock is guaranteed NEVER to occur?
In disk systems, rotational latency is on average equal to:
An unsafe state in deadlock avoidance implies:
A system uses a 32-bit virtual address and 8 KB pages. How many bits are used for the virtual page offset?
A Round Robin scheduler has time quantum q = 2 ms. A single process with CPU burst 7 ms arrives at time 0. At what time (in ms) do…
The Optimal page replacement algorithm minimizes page faults by evicting the page that:
In semaphore synchronization, which of the following is true regarding busy waiting?
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.