Multiple Choice
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
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q9: The resource allocation graph is not applicable
Q10: A deadlock eventually cripples system throughput and
Q11: A computer system has 6 tape drives,
Q12: To_to a safe state, the system needs
Q13: 'm' processes share 'n' resources of the
Q15: A deadlock can be broken by<br>A)abort one
Q16: Every time a request for allocation cannot
Q17: The process to be aborted is chosen
Q18: If the resources are always preempted from
Q19: An edge from process Pi to Pj