A cycle in a resource-allocation graph is a necessary and sufficient condition for the existence of deadlock. That means
Posted: Fri May 20, 2022 2:42 pm
A cycle in a resource-allocation graph is a necessary and
sufficient condition for the existence of deadlock. That means,
that if a resource-allocation graph contains a cycle, there must
exist a deadlock.
-True/False
sufficient condition for the existence of deadlock. That means,
that if a resource-allocation graph contains a cycle, there must
exist a deadlock.
-True/False