GATE CS 2026 Set 1 — Question 29

MSQ+1 / -0MediumBanker's AlgorithmDeadlocksOperating SystemDeadlock PreventionResource Allocation Graph

Operating System → Deadlocks → Banker's Algorithm

Last updated 5 September 2026

Question

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

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 Solution The question asks for FALSE statements. (A) False. Banker's algorithm is a deadlock avoidance algorithm, not prevention. (B) True. Disallowing the 'hold and wait' condition is a valid deadlock prevention technique. (C) False. In a resource allocation graph, an assignment edge is directed from a resource to a process (R \to P). An edge from a process to a resource (P \to R) represents a request edge. (D) True. By definition, a safe state is one where there exists a sequence of processes such that each can satisfy its resource requests and terminate, thus guaranteeing no deadlock. Turn this into a strength. Explore AI-powered practice and doubt support with Success Tracker.

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

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 Solution The question asks for FALSE statements. (A) False. Banker's algorithm is a deadlock avoidance algorithm, not prevention. (B) True. Disallowing the 'hold and wait' condition is a valid deadlock prevention technique. (C) False. In a resource allocation graph, an assignment edge is directed from a resource to a process (R \to P). An edge from a process to a resource (P \to R) represents a request edge. (D) True. By definition, a safe state is one where there exists a sequence of processes such that each can satisfy its resource requests and terminate, thus guaranteeing no deadlock.

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.