Operating Systems · Deadlock
Official IIT answer key · IIT Roorkee · Audited Aug 2026
GATE CSE 2026 Set 1 Q35 · NAT · 1 mark
Key concept
No account needed
Sit 5 related DeadlockPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Across GATE CS exams from 2014 to 2026, the Deadlock topic is tested through three main angles: mathematical resource bounds using the pigeonhole principle, algorithmic simulation of Banker's safety and request algorithms, and rigorous conceptual analysis of Coffman conditions, prevention schemes, and Resource Allocation Graphs (RAG). The topic frequently yields both 1-mark and 2-mark questions, with a significant recent pivot toward multi-select questions (MSQ) and code/graph analysis.
Full Deadlock guide →Consider a system consisting of k instances of a resource R, being shared by 5 processes. Assume that each process requires a maximum of two instances of resource R and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance. The minimum value of k for the system to be deadlock-free is … (answer in integer)
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
