Complete the code to name one of the four conditions necessary for a deadlock.
One of the four conditions for deadlock is called [1].
Mutual Exclusion means that at least one resource must be held in a non-shareable mode. This is one of the four necessary conditions for deadlock.
Complete the code to name another condition required for deadlock.
Another condition for deadlock is [1], where processes hold resources while waiting for others.
Hold and Wait means processes hold at least one resource and wait to acquire additional resources held by others.
Fix the error in naming the third condition for deadlock.
The third condition is called [1], where a chain of processes each waits for a resource held by the next.
Circular Wait means there is a cycle of processes each waiting for a resource held by the next process in the cycle.
Fill both blanks to complete the last condition for deadlock and its meaning.
The last condition is [1], which means resources cannot be [2] from a process holding them.
No Preemption means that resources cannot be forcibly taken away from a process; the process must release them voluntarily.
Fill all three blanks to complete the summary of the four conditions for deadlock.
Deadlock occurs if [1], [2], [3], and circular wait all happen together.
The four conditions for deadlock are Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait. All must be true for deadlock to occur.