Multiple Choice
If the wait for graph contains a cycle
A) then a deadlock does not exist
B) then a deadlock exists
C) then the system is in a safe state
D) either deadlock exists or system is in a safe state
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q1: Those processes should be aborted on occurrence
Q2: The data structures available in the Banker's
Q3: What is the disadvantage of invoking the
Q4: If deadlocks occur frequently, the detection algorithm
Q6: The two ways of aborting processes and
Q7: What is Address Binding?<br>A)going to an address
Q8: A system has 3 processes sharing 4
Q9: The resource allocation graph is not applicable
Q10: A deadlock eventually cripples system throughput and
Q11: A computer system has 6 tape drives,