Solved

A Computer System Has 6 Tape Drives, with 'N' Processes

Question 11

Multiple Choice

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?


A) 2
B) 3
C) 4
D) 1

Correct Answer:

verifed

Verified

Unlock this answer now
Get Access to more Verified Answers free of charge

Related Questions

Q6: The two ways of aborting processes and

Q7: What is Address Binding?<br>A)going to an address

Q8: A system has 3 processes sharing 4

Q9: The resource allocation graph is not applicable

Q10: A deadlock eventually cripples system throughput and

Q12: To_to a safe state, the system needs

Q13: 'm' processes share 'n' resources of the

Q14: The wait-for graph is a deadlock detection

Q15: A deadlock can be broken by<br>A)abort one

Q16: Every time a request for allocation cannot