Term
| The following four conditions must hold simultaneously in a system for deadlock to occur |
|
Definition
Mutual exclustion
Hold and wait
No pre-emption
Circular wait |
|
|
Term
| The following are three general ways we can deal with deadlock |
|
Definition
safe state
resource-allocation-graph algorithm
baker’s algorithm |
|
|
Term
| Which of the following is an example where mutual exclusion needs to be applied |
|
Definition
| If another process requests a non-sharable resource, the requesting process must be delayed until the resource has been released |
|
|
Term
| Which of the following is an example of hold and wait? |
|
Definition
| A process is holding at least one resource and waiting to acquire additional resources that are being held by other processes |
|
|
Term
| What does no preemption mean? |
|
Definition
| A resource can only be voluntarily released by the process holding it after that process has completed its task |
|
|
