Question

m processes share n resources of the same type. The maximum need of each process doesnt exceed n and the sum of all their maximum needs is always less than m+n. In this setup, deadlock : a) can never occur b) may occur c) has to occur d) none of the mentioned

Answer 1

Answer:

m processes share n resources of the same type. The maximum need of each process doesnt exceed n and the sum of all their maximum needs is always less than m+n. In this setup, deadlock : a) can never occur b) may occur c) has to occur d) none of the mentioned

Explanation:

b

Answer 2

The deadlock can never occur

Given:

The area unit m processors and n resources .The maximum wanted is often but m + n

To find:

The maximum would be like every method does not exceed n

Solution:

Distribute every method to 1 but most request resources

= 3(2-1)

= 3

Total no. of resources = 3+1

(Additional resources)

If total no. resources area unit bigger than given resources then it can occur,

= 3+1

Hence, deadlock can never occur

#SPJ3