In a Resource Allocation Graph (RAG) where EVERY resource type has EXACTLY ONE instance, what does the presence of a directed cycle indicate?
Option B is correct. If a Resource Allocation Graph (RAG) contains a cycle and every resource type has only ONE instance, then a deadlock DEFINITELY exists. (If multiple instances exist, a cycle is a necessary but not sufficient condition).
In Banker's Algorithm for Deadlock Avoidance, given Max matrix M and Allocation matrix A, how is the Need matrix N calculated for each process i?
Option E is correct. The Need matrix represents remaining resource demands for each process: Need[i][j] = Max[i][j] - Allocation[i][j].
If a system has 4 processes sharing 3 instances of a single resource type, and each process requires at most 2 instances, can a deadlock occur?
Option A is correct. Formula for guaranteed deadlock freedom: Total Resources R >= sum(Max_i - 1) + 1 = 4*(2-1) + 1 = 5. Since system has only 3 instances (less than 5), each process could hold 1 resource and request another, causing a deadlock.
What approach to Deadlock handling ignores the problem entirely, assuming deadlocks occur very rarely (used by general-purpose OS like Linux and Windows)?
Option B is correct. The Ostrich Algorithm is a strategy of ignoring potential deadlocks under the assumption that they occur infrequently and the cost of prevention/avoidance outweighs occasional manual user restarts.
Which Deadlock Prevention strategy prevents the 'Hold and Wait' condition?
Option B is correct. To prevent Hold & Wait, protocols mandate that a process must request and receive all required resources simultaneously prior to execution, or release current resources before requesting additional ones.