4 processes each need 3 instances of a resource. Minimum instances needed so that deadlock never occurs:
Show answerHide answer
Correct answer: (D) 9
Explanation
n(k − 1) + 1 = 4 × 2 + 1 = 9.
From DSSSB TGT Computer Science Full Mock Test 2
This is question 122 of DSSSB TGT Computer Science Full Mock Test 2. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.