Register
Filter

Recent activity by vvk

1 answer
1
Test by Bikram | Operating Systems | Test 2 | Question: 7
A computer system has $6$ tape drives with n process competing for them. Each process may need up-to $2$ tape drives. The maximum value of n from which the system is guaranteed to be deadlock free is: $2$ $3$ $4$ $1$
A computer system has $6$ tape drives with n process competing for them. Each process may need up-to $2$ tape drives. The maximum value of n from which the system is guar...