GATE CSE 2022 Q26: True statements about deadlock conditions and graphs
- Operating System
- 1 mark
- MSQ
- No negative marking
Question
Which of the following statements is/are TRUE with respect to deadlocks?
Try it: multiple select: one or more correct options
Select all correct options. No negative marking, no partial marks.
Show answer and explanation
Answer: A, D (official GATE 2022 final answer key)
Concept used: Coffman conditions; a cycle is sufficient for deadlock only with single-instance resources; unsafe does not mean deadlocked.
First step: With no request edges, no process is waiting for anything; check what that implies for statement (D).
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2022 CS question paper and final answer key, organised by IIT Kharagpur. Question paper · Answer key
More Operating System PYQs
- 2026 Session 1 · Q29False statements about deadlocks
- 2026 Session 1 · Q35Minimum resource instances for deadlock freedom (5 processes, max 2)
- 2026 Session 1 · Q59Disk transfer time for random sectors on tracks 5, 12, 7
- 2026 Session 1 · Q63Number of printf calls with fork, continue and break
- 2026 Session 1 · Q64Average FCFS waiting time for alternating A and C processes
- 2026 Session 2 · Q23CPU scheduling algorithm that cannot be preemptive