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.

Related MCQs

• A deadlock avoidance algorithm dynamically examines the                      to ensure that a circular wait condition can never exist.
• The wait-for graph is a deadlock detection algorithm that is applicable when
• To avoid deadlock                          
• To avoid deadlock                          
• To avoid deadlock
• 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?
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock                          
• Which of the following condition is required for a deadlock to be possible?
• Which of the following condition(s) is/are required for a deadlock to be possible?
• Which of the following condition is required for deadlock to be possible?