GATE CS 2026 (Forenoon) — Question 35

Operating Systems (OS)Deadlock Prevention, Avoidance, Detection, RecoveryNAT1 markMedium

Consider a system consisting of \( k \) instances of a resource \( R \), being shared by 5 processes. Assume that each process requires a maximum of two instances of resource \( R \) and a process can request or release only one instance at a time. Further, a process can request the second instance of the resource only after acquiring the first instance. The minimum value of \( K \) for the system to be deadlock-free is ________. (answer in integer)
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
Practise more on Deadlock Prevention, Avoidance, Detection, RecoveryTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group