a) minimum b) average c) maximum d) approximate Answer: c Explanation: maximum
View QuestionEach 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.
a) resources currently available b) processes that have previously been in the system c) resources currently allocated to each ...
View QuestionOne way to ensure that the circular wait condition never holds is to ____________
a) impose a total ordering of all resource types and to determine whether one precedes another in ...
View QuestionTo ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it ____________
a) then the process waits for the resources be allocated to it b) the process keeps ...
View QuestionThe disadvantage of a process being allocated all its resources before beginning its execution is ____________
a) Low CPU utilization b) Low resource utilization c) Very high resource utilization d) None of the mentioned
View QuestionTo ensure that the hold and wait condition never occurs in the system, it must be ensured that ____________
a) whenever a resource is requested by a process, it is not holding any other resources b) each ...
View QuestionFor sharable resources, mutual exclusion ____________
a) is required b) is not required c) may be or may not be required d) none of the mentioned
View QuestionFor non sharable resources like a printer, mutual exclusion ____________
a) must exist b) must not exist c) may exist d) none of the mentioned Answer: a Explanation: ...
View QuestionDeadlock prevention is a set of methods ____________
a) to ensure that at least one of the necessary conditions cannot hold b) to ensure that all of the ...
View QuestionFor a Hold and wait condition to prevail ____________
a) A process must be not be holding a resource, but waiting for one to be freed, and then ...
View Question