How many ways for dealing with deadlock?
a) one
b) two
c) three
d) four
Explanation: deadlock prevention, deadlock recovery, deadlock detection
In deadlock prevention scheme, the mutual exclusion condition must hold if
a) one resource must be no shareable
b) at least one resource must be shareable
c) process requests it does not hold resource
d) all of these
……. is a technique that is used to avoid deadlock.
a) Safe state
b) deadlock avoidance
c) resource allocation
d) none of mentions
Resource allocation algorithm is used to avoid deadlock. This algorithm uses the resource allocation graph by introducing new edge called
a) claim edge
b) left edge
c) right edge
d) none
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
A state is safe, if……..
a) the system does not crash
b) allocate resources to each process
c) the state keeps the system protected
d) all of these
