1.

If the wait for graph contains a cycle ____________(a) then a deadlock does not exist(b) then a deadlock exists(c) then the system is in a safe state(d) either deadlock exists or system is in a safe stateThe question was asked by my school teacher while I was bunking the class.Question is taken from Deadlock Detection topic in portion Deadlocks of Operating System

Answer»

The CORRECT answer is (B) then a deadlock exists

The BEST I can explain: None.



Discussion

No Comment Found

Related InterviewSolutions