Q. A process must be holding at least one resource and waiting to acquire additional resources that are currently being held by other processes. This condition for deadlock is known as _______ .
Q. The circular wait condition can be prevented by ___________
Q. Which one of the following is the deadlock avoidance algorithm?
Q. A problem encountered in multitasking when a process is perpetually denied necessary resources is known as ____________.
Q. To avoid deadlock ________.
Q. In deadlock prevention, the number of resources requested by a process ____________ the total number of resources available in the system.
Q. For non-sharable resources like a printer, mutual exclusion _______.
Q. A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
Q. In deadlock avoidance, the state of the system will continuously be checked for ____.
Q. If no cycle exists in the resource allocation graph, then the system ______.
Q. The wait-for graph deadlock detection algorithm is applicable when ____________
Q. The operating system can detect deadlock with the help of _______.
Q. Which of the following factors is considered to select the process that will be aborted?
Q. Cost factors for process termination include _______.
Q. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be _____.
