Deadlock Avoidance — Test 1
Page 1 of 2
Question 1
A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
0
System Administrator 2026
Question 2
Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
0
System Administrator 2026
Question 3
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.
0
System Administrator 2026
Question 4
A state is safe, if ____________
0
System Administrator 2026
Question 5
A system is in a safe state only if there exists a ____________
0
System Administrator 2026
Question 6
All unsafe states are ____________
0
System Administrator 2026
Question 7
A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives. advertisement Process P0 P1 P2 Maximum needs (process-wise: P0 through P2 top to bottom) 10 4 9 Currently allocated (process-wise) 5 2 2 Which of the following sequence is a safe sequence?
0
System Administrator 2026
Question 8
If no cycle exists in the resource allocation graph ____________
0
System Administrator 2026
Question 9
The resource allocation graph is not applicable to a resource allocation system ____________
0
System Administrator 2026
Question 10
The Banker’s algorithm is _____________ than the resource allocation graph algorithm.
0
System Administrator 2026