- Courses
- Tutorials
- Interview Prep
GATE 2026 OS PYQs | DEADLOCKS
Question 1
With respect to deadlocks in an operating system, which of the following statements is/are FALSE? [GATE 2026 || SET-1 MSQ || 1-mark]
Banker’s algorithm is used to prevent deadlocks
Deadlock formation can be prevented by ensuring that the hold and wait condition is not allowed
An assignment edge in a resource allocation graph is marked from a process to a resource
A safe state guarantees that all processes can finish without formation of a deadlock
Question 2
Consider a system consisting of k instances of a resource R, being shared by 5 processes.
Assume:
● Each process requires a maximum of two instances of resource R.
● A process can request or release only one instance at a time.
● A process can request the second instance only after acquiring the first instance.
The minimum value of k for the system to be deadlock-free is [GATE 2026 || SET-1 NAT || 1-mark]
There are 2 questions to complete.