Question: 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>
Answer:
MCQ: 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>
Correct Answer:
A. 1
Discuss a Question
Related Questions
- 1. In Deadlock Detection Algorithm The wait-for graph scheme is applicable to
- 2. wait-for graph can be obtained from the resource-allocation graph by
- 3. an edge from Pi to Pj in a wait-for graph implies that
- 4. An edge Pi → Pj exists in a wait-for graph if and only if
- 5. a deadlock exists in the system if and only if the wait-for graph contains a
- 6. 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
- 7. When should we invoke the detection algorithm?
- 8. invoking the deadlock-detection algorithm for every resource request will incur considerable overhead in
- 9. Which of the following is options for breaking a deadlock
- 10. which of the following method can be used to eliminate deadlock under process termination
You may be interested in:
OS Deadlocks MCQsRecently Added Articles
How Can AI Simplify the Academic Life of Students?
Last updated on: April 16, 2025Posted by: ExamRadar
Want to Clear IBPS RRB PO? Master These Mock Test Hacks!
Last updated on: March 10, 2025Posted by: ExamRadar
Top AI Tools for Instantly Detecting Plagiarized Writing
Last updated on: December 5, 2024Posted by: ExamRadar
Applying Algorithmic Trading Techniques to Forex: Insights for Programmers and Data Scientists
Last updated on: November 22, 2024Posted by: ExamRadar
Image to Text Conversion Made Easy: Online Tool Insights
Last updated on: April 12, 2024Posted by: ExamRadar
