Multiple Choice
'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum of all their maximum needs is always less than m+n. In this setup, deadlock___________
A) can never occur
B) may occur
C) has to occur
D) none of the mentioned
Correct Answer:
Verified
Correct Answer:
Verified
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,
Q12: To_to a safe state, the system needs
Q14: The wait-for graph is a deadlock detection
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