Department of Computer Science and Engineering

Student Name…………………..………….. Enroll. No…………………………….…..

Semester………………………………...….. Date………………………………….…...
Course Code.……………………..………… Course Title………………………………
Quiz/Test No.: 2 Marks Obtained…………………………..
Max. Marks : ………..…………………… Evaluator’s Sign……………………….....

1. Each request requires that the system consider c) safe sequence

the _____________ to decide whether the current d) all of the mentioned
request can be satisfied or must wait to avoid a
future possible deadlock.
a) resources currently available 6. All unsafe states are ____________
b) processes that have previously been in the a) deadlocks
system b) not deadlocks
c) resources currently allocated to each process c) fatal
d) future requests and releases of each process d) none of the mentioned

2. Given a priori information about the ________ 7. A system has 12 magnetic tape drives and 3
number of resources of each type that maybe processes : P0, P1, and P2. Process P0 requires 10
requested for each process, it is possible to tape drives, P1 requires 4 and P2 requires 9 tape
construct an algorithm that ensures that the system drives.
will never enter a deadlock state.
a) minimum Process
b) average P0
c) maximum P1
d) approximate P2

Maximum needs (process-wise: P0 through P2 top

3. A deadlock avoidance algorithm dynamically to bottom)
examines the __________ to ensure that a circular 10
wait condition can never exist. 4
a) resource allocation state 9
b) system storage state
c) operating system Currently allocated (process-wise)
d) resources 5
2
2
4. A state is safe, if ____________ Which of the following sequence is a safe
a) the system does not crash due to deadlock sequence?
occurrence a) P0, P1, P2
b) the system can allocate resources to each process b) P1, P2, P0
in some order and still avoid a deadlock c) P2, P0, P1
c) the state keeps the system protected and safe d) P1, P0, P2
d) all of the mentioned

8. If no cycle exists in the resource allocation graph

5. A system is in a safe state only if there exists a ____________
____________ a) then the system will not be in a safe state
a) safe allocation b) then the system will be in a safe state
b) safe resource c) all of the mentioned
d) none of the mentioned

9. 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

10. The Banker’s algorithm is _____________ than

the resource allocation graph algorithm.
a) less efficient
b) more efficient
c) equal
d) none of the mentioned