Multiple Choice
A deadlock can be broken by
A) abort one or more processes to break the circular wait
B) abort all the process in the system
C) preempt all resources from all processes
D) none of the mentioned
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
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
Q14: The wait-for graph is a deadlock detection
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
Q20: Cost factors for process termination include_<br>A)number of