Question: avoiding deadlocks is to require additional information about how resources are to be requested .In order to avoid a possible future deadlock which of the following information is required?
Answer:
MCQ: avoiding deadlocks is to require additional information about how resources are to be requested .In order to avoid a possible future deadlock which of the following information is required?
Correct Answer:
A. Each request requires that in making this decision the system consider the resources currently available
Discuss a Question
Related Questions
- 1. avoiding deadlocks ,The simplest and most useful model requires that each process declare the ____ of resources of each type that it may need
- 2. A deadlock-avoidance algorithm dynamically examines the ____ to ensure that a circular-wait condition can never exist.
- 3. In A deadlock-avoidance algorithm The resource allocation state is defined by
- 4. In A deadlock-avoidance algorithm A state is safe if
- 5. consider a system with twelve magnetic tape drives and three processes: P0, P1, and P2. Process P0 requires ten tape drives, process P1 may need as many as four tape drives, and process P2 may need up to nine tape drives. Suppose that, at time t0, process P0 is holding five tape drives, process P1 is holding two tape drives, and process P2 is holding two tape drives. (Thus, there are three free tape drives.) </br> Maximum Needs Current Needs </br> P0 10 5 </br> P1 4 2 </br> P2 9 2 </br> At time t0, Which of the following sequence is a safe sequence ?
- 6. Which of the following stands true for Resource-allocation graph for deadlock avoidance.
- 7. The resource-allocation-graph algorithm is not applicable to___
- 8. which of the following statement is True for Banker algorithm for deadlock-avoidance.
- 9. 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>
- 10. In Deadlock Detection Algorithm The wait-for graph scheme is applicable to
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
