Made Easy Mock -1

Question

 

Comments

.

Answer 1

We have to make given resources minimum in order to find a+b max. Given resources should barely satisfy the needs of the processes ..

 

If you know than we always give one resource less than the peak demand and add them up and then give one more so that deadlock not occurs. This gives min no of resources such that deadlock never occurs

(3-1) +(6-1) + (a-1) + (b-1) +1 = 22

This gives a+b = 16 so we need count pairs such that (0,16) (1,15)...... (15,1), (16,0) such that there are 32 pairs

Comments

@Purnendu Bhatt answer is 153 even though I also have the same approach

please check the given solution for that in the below image