Question

A deadlock avoidance algorithm dynamically examines the

Answer 1

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

Answer 2

Explanation:

Explanation:

Greedy algorithm have a local choice of the sub-problems whereas Dynamic programming would solve the all sub-problems and then select one that would lead to an optimal solution. Greedy algorithm take decision in one time whereas Dynamic programming take decision at every stage.