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?

Related MCQs

• ‘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                          
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock                          
• There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?
• Magnetic tape drives can write data at a speed                  disk drives.
• Those processes should be aborted on occurrence of a deadlock, the termination of which?
• A set of processes is deadlock if
• A circuitry that processes that responds to and processes the basic instructions that are required to drive a computer system is
• 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 deadlock free solution to the dining philosophers problem                          
• For an effective operating system, when to check for deadlock?