In this section of Operating System CPU Scheduling MCQs.it contain Operating System Process Management – Recovery from Deadlock 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. Which of the following is options for breaking a deadlock
- simply abort one Process
- simply abort one or more processes to break the circular wait
- preempt some resources from one or more of the deadlocked processes
- All of the above
D. All of the above
2. which of the following method can be used to eliminate deadlock under process termination
- Abort all deadlocked processes
- Abort one process at a time until the deadlock cycle is eliminated
- It is not possible to abort all deadlocked process
- A and B
D. A and B
3. In which of the following method after each process is aborted, a deadlock-detection algorithm must be invoked to determine whether any processes are still deadlocked.
- Abort all deadlocked processes
- Abort one process at a time until the deadlock cycle is eliminated
- preempt some resources from one or more of the deadlocked processes
- None of the above
B. Abort one process at a time until the deadlock cycle is eliminated
4. we should abort those processes whose termination will incur
- the average cost
- the Maximum cost
- the minimum cost
- None of the above
C. the minimum cost
5. Many factors may affect which process is chosen for termination, including:
- What the priority of the process is
- How long the process has computed and how much longer the process will compute before completing its designated task
- How many and what types of resources the process has used (for example,whether the resources are simple to preempt)
- All of the above
D. All of the above
6. If preemption is required to deal with deadlocks, which of the following issues need to be addressed:
- Selecting a victim
- Rollback
- Starvation
- All of the above
D. All of the above
7. Which resources and which processes are to be preempted? As in process termination, we must determine the order of preemption to minimize cost. Cost factors may include which of the below parameters
- as the number of resources a deadlocked process is holding
- the amount of time the process has thus far consumed.
- A and B
- None of the above
C. A and B
8. If we preempt a resource from a process, Which of the following stands true?
- it cannot continue with its normal execution; it is missing some needed resource.
- We must roll back the process to some safe state and restart it from that state
- it can continue with its normal execution; it is missing some needed resource.
- We should not roll back the process to some safe state and restart it from that state
- 1
- 1,2
- 2,3
- 3,4
B. 1,2
9. Which of the following method requires the system to keep more information about the state of all running processes to break the deadlock in Resource Preemption
- Selecting a victim
- Rollback
- Starvation
- deadlock-detection
B. Rollback
Since, in general, it is difficult to determine what a safe state is, the simplest solution is a total rollback: abort the process and then restart it. Although it is more effective to roll back the process only as far as necessary to break the deadlock, this method requires the system to keep more information about the state of all running processes.
10. In Resource preemtion which of the following causes starvation to occur
- resources are always preempted from the same process
- resources will not always be preempted from the same process
- Abort all deadlocked processes
- Abort one process at a time until the deadlock cycle is eliminated
A. resources are always preempted from the same process
11. Which following is the solution to starvation problem in resource preemtion
- the same process is always picked as a victim
- we must ensure that a process can be picked as a victim only a (small) finite number of times
- A and B both
- None of the above
B. we must ensure that a process can be picked as a victim only a (small) finite number of times
