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

Related MCQs

• Thrashing the CPU utilization.
• A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?
• Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
• For an effective operating system, when to check for deadlock?
• 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 system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock                          
• The                    determines the cause of the interrupt, performs the necessary processing and executes a return from the interrupt instruction to return the CPU to the execution state prior to the interrupt.
• The                program initializes all aspects of the system, from CPU registers to device controllers and the contents of main memory, and then starts the operating system.
• Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?
• ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock