1.

Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.(a) minimum(b) average(c) maximum(d) approximateThis question was posed to me by my college professor while I was bunking the class.My enquiry is from Deadlock Avoidance in chapter Deadlocks of Operating System

Answer» RIGHT ANSWER is (C) maximum

To EXPLAIN: NONE.


Discussion

No Comment Found

Related InterviewSolutions