0 — Test 380
Page 1 of 3
Question 1
To ensure that the hold and wait condition never occurs in the system, it must be ensured that ____________
0
System Administrator 2026
Question 2
The disadvantage of a process being allocated all its resources before beginning its execution is ____________
0
System Administrator 2026
Question 3
To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it ____________
0
System Administrator 2026
Question 4
One way to ensure that the circular wait condition never holds is to ____________
0
System Administrator 2026
Question 5
The wait-for graph is a deadlock detection algorithm that is applicable when ____________
0
System Administrator 2026
Question 6
An edge from process Pi to Pj in a wait for graph indicates that ____________
0
System Administrator 2026
Question 7
If the wait for graph contains a cycle ____________
0
System Administrator 2026
Question 8
If deadlocks occur frequently, the detection algorithm must be invoked ________
0
System Administrator 2026
Question 9
What is the disadvantage of invoking the detection algorithm for every request?
0
System Administrator 2026
Question 10
A deadlock eventually cripples system throughput and will cause the CPU utilization to ______
0
System Administrator 2026