Deadlock Detection — Test 1
Page 1 of 1
Question 1
The wait-for graph is a deadlock detection algorithm that is applicable when ____________
0
System Administrator 2026
Question 2
An edge from process Pi to Pj in a wait for graph indicates that ____________
0
System Administrator 2026
Question 3
If the wait for graph contains a cycle ____________
0
System Administrator 2026
Question 4
If deadlocks occur frequently, the detection algorithm must be invoked ________
0
System Administrator 2026
Question 5
What is the disadvantage of invoking the detection algorithm for every request?
0
System Administrator 2026
Question 6
A deadlock eventually cripples system throughput and will cause the CPU utilization to ______
0
System Administrator 2026
Question 7
Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________
0
System Administrator 2026
Question 8
A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?
0
System Administrator 2026
Question 9
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________
0
System Administrator 2026
Question 10
‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock ____________
0
System Administrator 2026