Which of the following statements is/are TRUE with respect to deadlocks?

GATE · 2022 · CS · Computer Science & IT

1. A.

   Circular wait is a necessary condition for the formation of deadlock.

2. B.

   In a system where each resource has more than one instance, a cycle in its wait-for graph indicates the presence of a deadlock.

3. C.

   If the current allocation of resources to processes leads the system to unsafe state, then deadlock will necessarily occur.

4. D.

   In the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.

Attempted by 320 students.