Question discussion

Four processes share identical resource units, and each process needs at most 3 units. What is the minimum number of units that guarantees…

938Medium DSSSB TGT Computer Science 0 replies

Four processes share identical resource units, and each process needs at most 3 units. What is the minimum number of units that guarantees the system is deadlock-free?

Correct answer: C

Explanation

Deadlock-freedom is guaranteed when units ≥ n(m − 1) + 1 = 4 × 2 + 1 = 9.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!