An edge from process Pi to Pj in a wait for graph indicates that _____ – McqOptions

MCQOPTIONS

1.	An edge from process Pi to Pj in a wait for graph indicates that ____________
A.	Pi is waiting for Pj to release a resource that Pi needs
B.	Pj is waiting for Pi to release a resource that Pj needs
C.	Pi is waiting for Pj to leave the system
D.	Pj is waiting for Pi to leave the system
Answer» B. Pj is waiting for Pi to release a resource that Pj needs

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 ____________