If no cycle exists in the resource allocation graph: a) A deadlock exists in the

Question

If no cycle exists in the resource allocation graph: a) A deadlock exists in the system b) A deadlock does not exist in the system c) A deadlock may exit in the system d) None of these 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) Approximate The ______ time in a swap out of a running process and swap in of a new process into the memory is very high. a) Context-switch b) Waiting c) Execution d0 Blocking

Explanation / Answer

[11]
Answer : [B] System is not deadlocked
Explaination :
If no cycle exists in the resource allocation graph then the system will be in a safe state.

[12]
Answer : [C] Maximum
Explaination :
This Define the deadlock-avoidance approach which is synamically exmines the resource-allocation state to ensure that a circular-wait condition can never exist.

[13]
Answer : [A] Context Switch

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.