Which of the following is NOT one of Coffman's four necessary conditions for a deadlock to occur in an operating system?
Option B is correct. The four necessary conditions for deadlock (Coffman conditions) are Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait. 'Preemption of resources' actually prevents deadlock.
In a Resource Allocation Graph (RAG), if every resource type has exactly ONE instance and the graph contains a cycle, what can be definitively concluded?
Option B is correct. In a single-instance RAG, a cycle is a necessary AND sufficient condition for deadlock. If multi-instance resources exist, a cycle is only a necessary condition.
Banker's Algorithm developed by Edsger Dijkstra is used in operating systems for which purpose?
Option C is correct. Banker's Algorithm is a classic Deadlock Avoidance algorithm. It dynamically tests for safety by simulating the allocation of maximum declared resources before fulfilling a request.
In Banker's Algorithm, if Max[i][j] is the maximum demand of process i for resource j, and Allocation[i][j] is the currently allocated amount, what is the formula for the Need matrix?
Option B is correct. The remaining resource need for process i is calculated as Need[i][j] = Max[i][j] - Allocation[i][j].
Which deadlock handling strategy is commonly known as the 'Ostrich Algorithm' and is adopted by most general-purpose operating systems like Linux and Windows?
Option E is correct. The Ostrich Algorithm refers to ignoring the deadlock problem altogether because prevention/avoidance overhead is too high compared to rare occurrence rates.