Consider a computer system with 6 tape drives and 'n' processes comple – McqOptions

MCQOPTIONS

1.	Consider a computer system with 6 tape drives and 'n' processes completing for them. What is the maximum value of 'n' for the system to be deadlock free? (Assuming that each processes may need 3 tape drives)
A.	3
B.	2
C.	4
D.	7
Answer» C. 4

Discussion

No Comment Found

Related MCQs

A consumable resource is one that can be
The dining philosophers problem can be seen as representative of
A direct method of deadlock prevention is to prevent the occurrence of a circular
Deadlock prevention strategies are very
The simplest way of remove deadlock from the system is to ...
Linux includes all of the concurrency mechanism found in other
The common technique used for protecting a critical section in Linux is the
Which of the following approaches do not require knowledge of the system state?
In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates the _______________ condition of deadlock.
Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and