A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

A. Increase
B. Drop
C. Stay still
D. None of the mentioned

What is the disadvantage of invoking the detection algorithm for every request?

A. Overhead of the detection algorithm due to consumption of memory
B. Excessive time consumed in the request to be allocated memory
C. Considerable overhead in computation time
D. All of the mentioned

If deadlocks occur frequently, the detection algorithm must be invoked ________

A. Rarely
B. Frequently
C. Rarely & frequently
D. None of the mentioned

If the wait for graph contains a cycle ____________

A. Then a deadlock does not exist
B. Then a deadlock exists
C. Then the system is in a safe state
D. Either deadlock exists or system is in a safe state

An edge from process Pi to Pj in a wait for graph indicates that ____________

A. Pi is waiting for pj to release a resource that pi needs
B. Pj is waiting for pi to release a resource that pj needs
C. Pi is waiting for pj to leave the system
D. Pj is waiting for pi to leave the system

The wait-for graph is a deadlock detection algorithm that is applicable when ____________

A. All resources have a single instance
B. All resources have multiple instances
C. All resources have a single 7 multiple instances
D. All of the mentioned

One way to ensure that the circular wait condition never holds is to ____________

A. Impose a total ordering of all resource types and to determine whether one precedes another in the ordering
B. To never let a process acquire resources that are held by other processes
C. To let a process wait for only one resource at a time
D. All of the mentioned

To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it ____________

A. Then the process waits for the resources be allocated to it
B. The process keeps sending requests until the resource is allocated to it
C. The process resumes execution without the resource being allocated to it
D. Then all resources currently being held are preempted

The disadvantage of a process being allocated all its resources before beginning its execution is ____________

A. Low cpu utilization
B. Low resource utilization
C. Very high resource utilization
D. None of the mentioned

To ensure that the hold and wait condition never occurs in the system, it must be ensured that ____________

A. Whenever a resource is requested by a process, it is not holding any other resources
B. Each process must request and be allocated all its resources before it begins its execution
C. A process can request resources only when it has none
D. All of the mentioned