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
Answer:A
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
Explanation: Resource allocation states are used to maintain the availability of the already and current available resources.