Deadlocks Q.5

0. Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is

Answer
Comment
Array

Option : A
Explanation : Having 11 resources ensures that atleast 1 process will have no pending request. This process after using will release the resources and so deadlock can never occur.

Forgot your password?

I agree with the Terms.