Q. A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

View solution

Q. A state is safe, if :

View solution

Q. A system is in a safe state only if there exists a :

View solution

Q. All unsafe states are :

View solution

Q. If no cycle exists in the resource allocation graph :

View solution

Q. The resource allocation graph is not applicable to a resource allocation system :

View solution

Q. The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

View solution

Q. The data structures available in the Banker’s algorithm are :

View solution

Q. The content of the matrix Need is :

View solution

Q. The wait-for graph is a deadlock detection algorithm that is applicable when :

View solution

Q. An edge from process Pi to Pj in a wait for graph indicates that :

View solution

Q. If the wait for graph contains a cycle :

View solution

Q. If deadlocks occur frequently, the detection algorithm must be invoked ________

View solution

Q. The disadvantage of invoking the detection algorithm for every request is :

View solution

Q. A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

View solution

Q. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify :

View solution

Q. 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 :

View solution

Q. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock :

View solution

Q. ‘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 :

View solution

Q. A deadlock can be broken by :

View solution