In a resource-allocation graph, a cycle is

GPSC College Teaching (CS/IT) 2025

In a resource-allocation graph, a cycle is

  1. A.

    A necessary and sufficient condition for deadlock with a single instance of each resource type.

  2. B.

    A necessary and sufficient condition for deadlock with multiple instances of each resource type.

  3. C.

    An indication that the system is in a safe state.

  4. D.

    A state that can never lead to a deadlock.

Attempted by 21 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…