Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes?

Which of the following is not true with respect to deadlock prevention and deadlock avoidance schemes? Correct Answer In deadlock prevention, the request for resources is always granted if resulting state is safe

Concepts:

Deadlock prevention can be done by eliminating any of the below condition:

1. Mutual Exclusion

2. Hold and wait

3. No preemption

4. Circular Wait.

In deadlock prevention, the request for resources is not always granted if the resulting state is safe.

Deadlock avoidance can be done with Banker’s Algorithm.

Banker’s Algorithm

Banker’s Algorithm is resource allocation and deadlock avoidance algorithm which test all the request made by processes for resources, it checks for the safe state, if after granting request system remains in the safe state it allows the request and if there is no safe state it doesn’t allow the request made by the process. Deadlock avoidance requires knowledge of resource requirements a priori

Comparison

Deadlock prevention is more restrictive than deadlock avoidance.

Therefore statement 1 is false

Related Questions

Which are the two complementary deadlock-prevention schemes using timestamps?