1.

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) resourcesThis 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»

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.



Discussion

No Comment Found

Related InterviewSolutions