Question

to ensure that a circular wait condition can
3. A deadlock avoidance algorithm dynamically examines the
never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources​

Answer 1

Answer:This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “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

Explanation: