Question: which of the following statement is True for Banker algorithm for deadlock-avoidance.
Answer:
MCQ: which of the following statement is True for Banker algorithm for deadlock-avoidance.
Correct Answer:
A. When a new process enters the system, it must declare the maximum number of instances of each resource type that it may need. This number may not exceed the total number of resources in the system
Discuss a Question
Related Questions
- 1. Which of the following data structures must be maintained to implement the banker’s algorithm , where n is the number of processes in the system and m is the number of resource types: <ol> <li>A vector of length m indicates the number of available resources of each type. If Available[j] equals k, then k instances of resource type Rj are available.</li> <li>An n × m matrix defines the maximum demand of each process. If Max[i][j] equals k, then process Pi may request at most k instances of resource type Rj</li> <li>An n × m matrix defines the number of resources of each type currently allocated to each process. If Allocation[i][j] equals k, then process Pi is currently allocated k instances of resource type Rj.</li> <li>An n × m matrix indicates the remaining resource need of each process. If Need[i][j] equals k, then process Pi may need k more instances of resource type Rj to complete its task. Note that Need[i][j] equals Max[i][j] − Allocation[i][j].</li> </ol>
- 2. In Deadlock Detection Algorithm The wait-for graph scheme is applicable to
- 3. wait-for graph can be obtained from the resource-allocation graph by
- 4. an edge from Pi to Pj in a wait-for graph implies that
- 5. An edge Pi → Pj exists in a wait-for graph if and only if
- 6. a deadlock exists in the system if and only if the wait-for graph contains a
- 7. To detect deadlocks, the system needs to maintain the wait for graph and periodically invoke an algorithm that searches for a cycle in the graph. An algorithm to detect a cycle in a graph requires an
- 8. When should we invoke the detection algorithm?
- 9. invoking the deadlock-detection algorithm for every resource request will incur considerable overhead in
- 10. Which of the following is options for breaking a deadlock
You may be interested in:
OS Deadlocks MCQsRecently Added Articles
How Do Java Development Teams Use Docker and Kubernetes to Deploy Applications?
Last updated on: April 24, 2026Posted by: ExamRadar
AI vs Machine Learning: Key Differences Every Professional Should Know
Last updated on: February 13, 2026Posted by: ExamRadar
Office Cleaning Services That Elevate Sydney Offices
Last updated on: February 11, 2026Posted by: ExamRadar
What You Actually Learn About Exam Patterns From RBI Grade B Previous Year Papers?
Last updated on: February 9, 2026Posted by: ExamRadar
Mental Health Support That’s Closer Than You Think
Last updated on: January 7, 2026Posted by: ExamRadar
Transform Your Home’s Exterior with Columbus roofing company
Last updated on: November 27, 2025Posted by: ExamRadar
