Q. For non sharable resources like a printer, mutual exclusion :

View solution

Q. For sharable resources, mutual exclusion :

View solution

Q. To ensure that the hold and wait condition never occurs in the system, it must be ensured that :

View solution

Q. The disadvantage of a process being allocated all its resources before beginning its execution is :

View solution

Q. To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it :

View solution

Q. One way to ensure that the circular wait condition never holds is to :

View solution

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

View solution

Q. Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

View solution

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