6In a resource-allocation graph, a cycle with single-instance resources means:APossible deadlock onlyBStarvationCNo deadlockDDeadlock existsView AnswerDiscussWorkspaceReportSaveEasy
7Mutual exclusion, hold and wait, no pre-emption and ____ are the four deadlock conditions.AStarvationBThrashingCCircular waitDPagingView AnswerDiscussWorkspaceReportSaveEasy
8If a system is in an unsafe state, then:ADeadlock may occur but is not certainBDeadlock has already occurredCThe system must restartDDeadlock is impossibleView AnswerDiscussWorkspaceReportSaveEasy
9In a wait-for graph, an edge Pi → Pj means:APi is waiting for a resource held by PjBPi and Pj are threadsCPi holds a resource Pj wantsDPi created PjView AnswerDiscussWorkspaceReportSaveEasy
10Three processes each need 2 units of a resource to finish. What is the minimum number of units that guarantees no deadlock?A3B5C6D4View AnswerDiscussWorkspaceReportSaveMedium