The two ways of aborting processes and eliminating deadlocks are ____________

• A. Abort all deadlocked processes
• B. Abort all processes
• C. Abort one process at a time until the deadlock cycle is eliminated
• D. All of the mentioned

Those processes should be aborted on occurrence of a deadlock, the termination of which?

• A. Is more time consuming
• B. Incurs minimum cost
• C. Safety is not hampered
• D. All of the mentioned

The process to be aborted is chosen on the basis of the following factors?

• A. Priority of the process
• B. Process is interactive or batch
• C. How long the process has computed
• D. All of the mentioned

Cost factors for process termination include ____________

• A. Number of resources the deadlock process is not holding
• B. Cpu utilization at the time of deadlock
• C. Amount of time a deadlocked process has thus far consumed during its execution
• D. All of the mentioned

If we preempt a resource from a process, the process cannot continue with its normal execution and it must be ____________

• A. Aborted
• B. Rolled back
• C. Terminated
• D. Queued

To _______ to a safe state, the system needs to keep more information about the states of processes.

• A. Abort the process
• B. Roll back the process
• C. Queue the process
• D. None of the mentioned

If the resources are always preempted from the same process __________ can occur.

• A. Deadlock
• B. System crash
• C. Aging
• D. Starvation

What is the solution to starvation?

• A. The number of rollbacks must be included in the cost factor
• B. The number of resources must be included in resource preemption
• C. Resource preemption be done instead
• D. All of the mentioned

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.

• A. Resources currently available
• B. Processes that have previously been in the system
• C. Resources currently allocated to each process
• D. Future requests and releases of each process

Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

• A. Minimum
• B. Average
• C. Maximum
• D. Approximate