Question

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

(a) resource allocation state

(b) system storage state

(c) operating system

(d) resources

This question was addressed to me by my school teacher while I was bunking the class.

My query is from Deadlock Avoidance in chapter Deadlocks of Operating System

Answer 1

Right answer is (a) resource allocation state

For explanation: Resource allocation states are used to maintain the availability of the already and current available resources.