Question
a.
impose a total ordering of all resource types and to determine whether one precedes another in the ordering
b.
to never let a process acquire resources that are held by other processes
c.
to let a process wait for only one resource at a time
d.
all of the mentioned
Posted under Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. One way to ensure that the circular wait condition never holds is to :
Similar Questions
Discover Related MCQs
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
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
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
