The GATE Grind

GATE 2026 CS (CS1) – Question 29

Operating System · Deadlock · 1 mark · Multiple select

With respect to deadlocks in an operating system, which of the following statements is/are FALSE?

  1. Banker’s algorithm is used to prevent deadlocks
  2. Deadlock formation can be prevented by ensuring that the hold and wait condition is not allowed
  3. An assignment edge in a resource allocation graph is marked from a process to a resource
  4. A safe state guarantees that all processes can finish without formation of a deadlock

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (A) Banker’s algorithm is used to prevent deadlocks; (C) An assignment edge in a resource allocation graph is marked from a process to a resource

Explanation

We are asked to identify which statements are FALSE:
- (A) is FALSE: Banker's algorithm is a deadlock **avoidance** algorithm (dynamic state checking), NOT a deadlock prevention algorithm (which imposes static constraints to eliminate one of Coffman's four conditions).
- (B) is TRUE: Preventing the 'Hold and Wait' condition (e.g. requiring a process to request all its resources at once) is a standard deadlock prevention method.
- (C) is FALSE: In a Resource Allocation Graph (RAG), a **request edge** is directed from a process to a resource ($P_i \to R_j$), while an **assignment edge** is directed from a resource instance to a process ($R_j \to P_i$).
- (D) is TRUE: By definition, a system in a safe state has a safe sequence of processes ensuring everyone can finish without deadlock.

Therefore, statements (A) and (C) are FALSE.