The wait-for graph is a deadlock detection algorithm that is applicable when ____________
A. all resources have a single instance
B. all resources have multiple instances
C. all resources have a single 7 multiple instances
D. all of the mentioned
Answer:A
The wait-for graph is a deadlock detection algorithm that is applicable when ____________
A. all resources have a single instance B. all resources have multiple instances C. all resources have a single 7 multiple instances D. all of the mentioned