In this section of Operating System CPU Scheduling MCQs.it contain Operating System Process Management – Deadlocks MCQs (Multiple Choice Questions Answers).All the MCQs (Multiple Choice Question Answers) requires in detail reading of Operating System subject as the hardness level of MCQs have been kept to advance level.
PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE
1. A deadlock situation can arise if which of the following conditions hold simultaneously in a system:
- Mutual exclusion
- Hold and wait
- No preemption
- All of the above
D. All of the above
2. At least one resource must be held in a nonsharable mode; that is, only one process at a time can use the resource. If another process requests that resource, the requesting process must be delayed until the resource has been released.This condition for deadlock is refered to as :
- Mutual exclusion
- Hold and wait.
- No preemption
- Circular wait
A. Mutual exclusion
3. A process must be holding at least one resource and waiting to acquire additional resources that are currently being held by other processes.This condition for deadlock is refered to as :
- Mutual exclusion
- Hold and wait.
- No preemption
- Circular wait
B. Hold and wait.
4. Resources cannot be preempted; that is, a resource can be released only voluntarily by the process holding it, after that process has completed its task.This condition for deadlock is refered to as :
- Mutual exclusion
- Hold and wait.
- No preemption
- Circular wait.
C. No preemption
5. A set {P0, P1, ..., Pn} of waiting processes must exist such that P0 is waiting for a resource held by P1, P1 is waiting for a resource held by P2, ..., Pn−1 is waiting for a resource held by Pn, and Pn is waiting for a resource held by P0.This condition for deadlock is refered to as :
- Mutual exclusion
- Mutual exclusion
- No preemption
- Circular wait.
D. Circular wait.
6. Deadlocks can be described more precisely in terms of a directed graph called a
- Bar graph
- system resource-allocation graph
- Pie charts
- Line graphs
B. system resource-allocation graph
7. Which of the following statements is TRUE for dealing with the deadlock problem:
- We can use a protocol to prevent or avoid deadlocks, ensuring that the system will never enter a deadlocked state.
- We can allow the system to enter a deadlocked state, detect it, and recover.
- We can ignore the problem altogether and pretend that deadlocks never occur in the system.
- 1
- 1,2
- 1,2,3
- None of the above
C. 1,2,3
8. To ensure that deadlocks never occur, the system can use
- deadlock prevention scheme
- deadlock-avoidance scheme
- deadlock-detection scheme
- deadlock-recovery scheme
- 1,2
- 1,2,3
- 3,4
- 1,2,3,4
A. 1,2
