GATE CS 2019 Set 1 — Question 49
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+2 / -0.67MediumDeadlock DetectionDeadlocksOperating SystemDeadlock Numericals
Operating System → Deadlocks → Deadlock Detection
Last updated
Question
Consider the following snapshot of a system running concurrent processes. Process is holding instances of a resource R, . Assume that all instances of R are currently in use. Further, for all , process can place a request for at most additional instances of R while holding the instances it already has. Of the processes, there are exactly two processes and such that . Which one of the following conditions guarantees that no other process apart from and can complete execution?
Correct answer
(A) Xₚ + X_q < Min \Yₖ 1 ≤ k ≤ n, k ≠ p, k ≠ q\
Solution
Since all instances of R are currently in use, the total number of resources in the system is .Processes and have and , meaning they need no additional resources to complete. They can finish execution and release their held resources, and .After and finish, the available resources will be .We want to guarantee that no other process can complete. A process (where ) needs at most resources. To ensure it cannot complete, the available resources must be strictly less than its requirement .To guarantee this for all other processes , the available resources () must be less than the minimum requirement of any such process.Therefore, the condition is:
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…