1.

A deadlock avoidance algorithm dynamically examines the

Answer»

A DEADLOCK AVOIDANCE algorithm dynamically examines the RESOURCE ALLOCATION STATE to ensure that a circular wait condition can never EXIST.



Discussion

No Comment Found