1.

The wait-for graph is a deadlock detection algorithm that is applicable when ____________(a) all resources have a single instance(b) all resources have multiple instances(c) all resources have a single 7 multiple instances(d) all of the mentionedI have been asked this question in an online interview.Origin of the question is Deadlock Detection topic in chapter Deadlocks of Operating System

Answer» CORRECT CHOICE is (a) all resources have a SINGLE instance

Easy explanation - NONE.


Discussion

No Comment Found

Related InterviewSolutions