5 votes 5 votes Consider a system with $m$ resources of same type being shared by $n$ processes. Resources can be requested and released by processes only one at a time. The system is deadlock free if and only if The sum of all max needs is $< m+n$ The sum of all max needs is $>m+n$ Both of above None Operating System nielit2016dec-scientistb-cs operating-system resource-allocation deadlock-prevention-avoidance-detection + – admin asked Mar 31, 2020 retagged Oct 27, 2020 by Krithiga2101 admin 3.1k views answer comment Share Follow See 1 comment See all 1 1 comment reply harypotter0 commented Jul 5, 2020 reply Follow Share Correct answer is a 1 votes 1 votes Please log in or register to add a comment.
2 votes 2 votes for deadlock free condition R ≥ P(N − 1) + 1 =m >=n(N-1)+1 = m>=nN-n+1 =m+n>=nN+1 here N=1 max need so m+n>=n+1 abhishek tiwary answered May 7, 2020 abhishek tiwary comment Share Follow See all 0 reply Please log in or register to add a comment.