GATE CSE 2026 Session 1 Q29: False statements about deadlocks
- Operating System
- 1 mark
- MSQ
- No negative marking
Question
With respect to deadlocks in an operating system, which of the following statements is/are FALSE?
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, C (official GATE 2026 final answer key)
Concept used: Prevention breaks a Coffman condition; avoidance (Banker's) checks for safe states at run time.
First step: Recall the edge directions: request edge process → resource, assignment edge resource → process.
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 2026 Session 1 CS question paper and final answer key, organised by IIT Guwahati. Question paper · Answer key
More Operating System PYQs
- 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
- 2026 Session 2 · Q51Possible output patterns of three processes using two semaphores