Complete the sentence to define a resource allocation graph.
A resource allocation graph is a directed graph that represents the allocation of [1] to processes.A resource allocation graph shows how resources are assigned to processes and how processes request resources.
Complete the sentence to explain the meaning of edges in a resource allocation graph.
An edge from a process to a resource means the process is [1] the resource.
In a resource allocation graph, an edge from a process to a resource means the process is requesting that resource.
Fix the error in the description of allocation edges in a resource allocation graph.
An edge from a resource to a process means the resource is [1] to the process.
Edges from a resource to a process indicate that the resource is allocated to that process.
Fill both blanks to complete the condition for a deadlock in a resource allocation graph.
A deadlock exists if there is a [1] in the graph and each resource node in the cycle has exactly [2] instance.
A deadlock occurs when there is a cycle in the resource allocation graph and each resource involved has only one instance.
Fill all three blanks to complete the description of how to detect deadlocks using resource allocation graphs.
To detect deadlocks, we look for a [1] in the graph. If found, we check if all resources in the cycle have [2] instance. If yes, the processes in the cycle are [3].
Deadlock detection involves finding a cycle where all resources have one instance, meaning the processes are deadlocked.