Consider a system having 'm' resources of the same type. 3 processes A,B,C... peak demands 3, 4, 6. Minimum 'm' to ensure no deadlock?
- A. 11
- B. 12
- C. 13
- D. 14
Answer: A. 11
Explanation: Deadlock happens if all request max-1. (3-1)+(4-1)+(6-1) = 2+3+5 = 10. If we have 10 resources, deadlock possible. If 11, at least one gets full. m = 11.