A computer system has 6 tape drives, with n process completing 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:
Answers
Answered by
3
Ans given is 2....But for 4 processes also there will be no deadlock ....If we initially allocate 1 to each process 2 will be available...and we can allocate those 2 to the first process...after its execution 3 tape drives will be free..and 2 could be allocated to next process...so continuing in this way we can allocate resources to each process without any deadlock......
Similar questions