A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that deadlocks never arise is _________.

Consider a system of consisting of six resources of the same type that are shared by four process. Each processneed at most 3 resources. Show that the system is deadlock free

A system is in the safe state ifGroup of answer choicesthere exists safe resourceall of thesethere exists safe sequencethe system can allocate resources to each process in some order and still avoid a deadlock

Which of the following condition is required for a deadlock to be possible?Group of answer choicesa process may hold allocated resources while awaiting assignment of other resourcesno resource can be forcibly removed from a process holding itmutual exclusionall of these

A set of processes is deadlock ifGroup of answer choicesall processes are trying to kill each othereach process is blocked and will remain so forevernone of the mentionedeach process is terminated