A system is in a safe state only if there exists a
a) safe allocation
b) safe resource
c) safe sequence
d) all of these
All unsafe states are…….
a) deadlocks
b) not deadlocks
c) fatal
d) none of these
The Banker’s algorithm is…......than the resource allocation graph algorithm.
a) less efficient
b) more efficient
c) equal
d) none of these
Banker’s algorithm prevents the following
a) Mutual exclusion
b) wait & hold
c) no preemption
d) circular wait
How many data structures are required in banker algorithm?
a) one
b) two
c) three
d) four
Explanation: available, max, allocated, need
When a resource is preempted from a process, it cannot continue its normal execution?
a) rollback
b) starvation
c) selection of victim
d) none of these
