The wait-for graph is a deadlock detection algorithm that is applicabl – McqOptions

MCQOPTIONS

1.	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» B. all resources have multiple instances

Discussion

No Comment Found

Related MCQs

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________
A computer system has 6 tape drives, with n processes competing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is?
Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________
If the wait for graph contains a cycle ____________
An edge from process Pi to Pj in a wait for graph indicates that ____________
The wait-for graph is a deadlock detection algorithm that is applicable when ____________