1. 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.
a) minimum
b) average
c) maximum
d) approximate
Explanation: maximum
2. A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources
Explanation: Resource allocation states are used to maintain the availability of the already and current available resources.
3. A state is safe, if ____________
a) the system does not crash due to deadlock occurrence
b) the system can allocate resources to each process in some order and still avoid a deadlock
c) the state keeps the system protected and safe
d) all of the mentioned
Explanation: A state is safe, if the system can allocate resources to each process in some order and still avoid a deadlock
4. A system is in a safe state only if there exists a ____________
a) safe allocation
b) safe resource
c) safe sequence
d) all of the mentioned
Explanation: A system is in a safe state only if there exists a safe sequence
5. All unsafe states are ____________
a) deadlocks
b) not deadlocks
c) fatal
d) none of the mentioned
Explanation: All unsafe states are not deadlocks
6. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.
Process
P0
P1
P2
Maximum needs (process-wise: P0 through P2 top to bottom)
10
4
9
Currently allocated (process-wise)
5
2
2
Which of the following sequence is a safe sequence?
a) P0, P1, P2
b) P1, P2, P0
c) P2, P0, P1
d) P1, P0, P2
Explanation: P1, P0, P2
7. 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
Explanation: If no cycle exists in the resource allocation graph then the system will be in a safe state
8. 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
Explanation: The resource allocation graph is not applicable to a resource allocation system with multiple instances of each resource type
9. The Banker’s algorithm is _____________ than the resource allocation graph algorithm.
a) less efficient
b) more efficient
c) equal
d) none of the mentioned
Explanation: The Banker’s algorithm is less efficient than the resource allocation graph algorithm.
10. The data structures available in the Banker’s algorithm are ____________
a) Available
b) Need
c) Allocation
d) All of the mentioned
Explanation: All of the mentioned