TOOLS AND TECHNIQUES FOR COMPILER DESIGN
MISCELLENOUS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
The best descriobed statement for Wait-for-graph
|
|
It is used to prevent the deadlock
|
|
|
To check the dependency of between the process and resources
|
|
|
To check the dependency of between the processes
|
|
|
To solve the deadlock for multiple instances
|
Explanation:
Detailed explanation-1: -Wait for Graph This is the suitable method for deadlock detection. In this method, a graph is created based on the transaction and their lock. If the created graph has a cycle or closed loop, then there is a deadlock.
Detailed explanation-2: -The wait-for graph can only be used for deadlock detection when there is a single instance of each type.
There is 1 question to complete.