Computer Sciences > Gate 2022 > 1

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

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

A

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

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.

C

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

D

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

Check Answer

Explanation

Correct : a,d

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science