Operating System MCQs

1019 MCQs  (Page 98 of 102)

For 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 request to acquire it
B. A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
C. A process must hold at least one resource and not be waiting to acquire additional resources
D. None of the mentioned
Deadlock 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 necessary conditions do not hold
C. To decide if the requested resources for a process have to be given or not
D. To recover from a deadlock
For non sharable resources like a printer, mutual exclusion ____________
A. Must exist
B. Must not exist
C. May exist
D. None of the mentioned
For sharable resources, mutual exclusion ____________
A. Is required
B. Is not required
C. May be or may not be required
D. None of the mentioned
To 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 process must request and be allocated all its resources before it begins its execution
C. A process can request resources only when it has none
D. All of the mentioned
The 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
To 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 sending requests until the resource is allocated to it
C. The process resumes execution without the resource being allocated to it
D. Then all resources currently being held are preempted
One 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 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
The wait-for graph is a deadlock detection algorithm that is applicable when ____________
A. All resources have a single instance
B. All resources have multiple instances
C. All resources have a single 7 multiple instances
D. All of the mentioned
An edge from process Pi to Pj in a wait for graph indicates that ____________
A. Pi is waiting for pj to release a resource that pi needs
B. Pj is waiting for pi to release a resource that pj needs
C. Pi is waiting for pj to leave the system
D. Pj is waiting for pi to leave the system