GATE CS 2015 Set 2 — Question 30
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyDeadlock NumericalsDeadlocksOperating System
Operating System → Deadlocks → Deadlock Numericals
Last updated
Question
A system has 6 identical resources and processes competing for them. Each process can request at most 2 resources. Which one of the following values of could lead to a deadlock?
Correct answer
(D) 4
Solution
Standard analysis. A deadlock needs every process to be blocked: each holds fewer than its maximum (so at most resource) and waits for another, while no resource is free. With processes that is possible only whenEquivalently, the system is guaranteed deadlock-free whenSo for each listed value:
- : at most 3 resources can be held by blocked processes, so some resource is always free; no deadlock.
- : in the worst case each process holds 1 resource, leaving 2 free, so any process can complete; no deadlock.
Continue learning with Success Tracker
A step still unclear? Work through it with support
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.
More questions on Deadlocks
2026 Set 2 Q23Which one of the following CPU scheduling algorithms cannot be preemptive?2026 Set 1 Q29With respect to deadlocks in an operating system, which of the following statements is/are FALSE?2026 Set 1 Q31In the context of relational database normalization, which of the following statements is/are true?2026 Set 1 Q35Consider a system consisting of instances of a resource , being shared by 5 processes.…2026 Set 2 Q51Consider three processes P1, P2, and P3 running identical code, as shown in the pseudocode below. A…