Question 11
Which of the following conditions is NOT one of the four necessary Coffman conditions for a deadlock to occur?
The 4 Coffman conditions are: Mutual Exclusion, Hold & Wait, No Preemption (preemption prevents deadlock), and Circular Wait.
Which of the following conditions is NOT one of the four necessary Coffman conditions for a deadlock to occur?
The 4 Coffman conditions are: Mutual Exclusion, Hold & Wait, No Preemption (preemption prevents deadlock), and Circular Wait.
A state is safe if -
A safe state means there exists at least one safe execution sequence that allows all processes to finish without entering a deadlock.
In a Resource Allocation Graph (RAG), if every resource class has only one instance, a cycle indicates -
For single-instance resource types, a cycle in the Resource Allocation Graph (RAG) is a necessary and sufficient condition for a deadlock.
Peterson's solution is a classic software-based solution to the critical section problem for how many processes?
Peterson's algorithm is a classic software synchronization mechanism designed strictly for 2 concurrent processes using flag array and turn variable.
A semaphore that can take non-negative integer values beyond 0 and 1 is called a -
A Counting Semaphore can take arbitrary non-negative integer values, used to control access to a resource pool with multiple instances.