Scribd
Upload
5 views3 pages

t3 - DL Avoidance

The document discusses deadlock avoidance in operating systems, highlighting key concepts such as safe states, resource allocation, and the conditions necessary to prevent deadlocks. It includes multiple-choice questions to assess understanding of these concepts, including the importance of knowing the maximum number of resources required by processes. Additionally, it mentions the Banker’s algorithm and its relevant data structures.

Uploaded by

05. Yogeshwari .R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

t3 - DL Avoidance

The document discusses deadlock avoidance in operating systems, highlighting key concepts such as safe states, resource allocation, and the conditions necessary to prevent deadlocks. It includes multiple-choice questions to assess understanding of these concepts, including the importance of knowing the maximum number of resources required by processes. Additionally, it mentions the Banker’s algorithm and its relevant data structures.

Uploaded by

05. Yogeshwari .R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Department Of Information Technology

CS3451 Introduction to Operating Systems


IInd yr - fourth semester
TOPIC: Deadlock Avoidance
1. Each request requires that the system consider the _____________ to decide whether
the current request can be satisfied or must wait to avoid a future possible deadlock.
a) resources currently available
b) processes that have previously been in the system
c) resources currently allocated to each process
d) future requests and releases of each process
Answer: a
2. 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
Answer: c
3. 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
Answer: a
4. 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
Answer: a
5. 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
Answer: c
6. All unsafe states are ____________
a) deadlocks
b) not deadlocks
c) fatal
d) none of the mentioned
Answer: b
7. 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.

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
Answer: d
8. 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
Answer: b
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
Answer: a
10. The data structures available in the Banker’s algorithm are ____________
a) Available
b) Need
c) Allocation
d) All of the mentioned
Answer: d

You might also like