OS Deadlocks
A system is in the safe state if ____________
the system can allocate resources to each process in some order and still avoid a deadlock
there exist a safe sequence
all of the mentioned
none of the mentioned
the system can allocate resources to each process in some order and still avoid a deadlock
Related posts
If deadlocks occur frequently, the detection algorithm must be invoked ________A. rarely
B. frequently
C. rarely & frequently
D. none of the mentioned
A deadlock can be broken by ____________
A. abort one or more processes to break the circular wait
B. abort all the process in the system
C. preempt all resources from all processes
D. none of the mentioned
For an effective operating system, when to check for deadlock?
A. every time a resource request is made
B. at fixed time intervals
C. every time a resource request is made at fixed time intervals
D. none of the mentioned
The resource allocation graph is not applicable to a resource allocation system ____________
A. with multiple instances of each resource type
B. with a single instance of each resource type
C. single & multiple instances of each resource type
D. none of the mentioned
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
If no cycle exists in the resource allocation graph ____________
A. then the system will not be in a safe state
B. then the system will be in a safe state
C. all of the mentioned
D. none of the mentioned
What is the solution to starvation?
A. the number of rollbacks must be included in the cost factor
B. the number of resources must be included in resource preemption
C. resource preemption be done instead
D. all of the mentioned
Leave a Reply