The deadlock avoidance algorithms dynamically examine the resource-allocation state to unsure that there can never be a ………………. Condition.
1
Mutual exclusion
2
Hold and wait
3
No Pre-emption
4
Circular wait
The deadlock avoidance algorithms dynamically examine the resource-allocation state to unsure that there can never be a ………………. Condition.
Mutual exclusion
Hold and wait
No Pre-emption
Circular wait