Requiring every process to request resources in a fixed increasing order of resource numbers prevents deadlock by eliminating which condition?
Correct answer B. Circular wait
Explanation
If resources are numbered and always requested in increasing order, a cycle of waiting processes is impossible, because following the cycle would require a resource number to be both greater and smaller than another. This lock-ordering rule is widely used in real kernels. Requesting all resources at once would attack hold and wait instead, and mutual exclusion usually cannot be removed for non-sharable resources.
Answer checked How we write and check questions
Discussion