Operating System MCQ and Answers – Deadlock Avoidance

These Operating System MCQ and Answers – Deadlock Avoidance are asked in various examinations including BCA, MCA, GATE, and other tests. The questions based on the below Operating System MCQ and Answers – Deadlock Avoidance test your basic knowledge of MCQs on the topic of Operating Systems and the level of comprehension and grasp that you hold.

Operating System MCQ and Answers – Deadlock Avoidance

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

2. 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: b

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

4. All unsafe states are ____________

a) deadlocks

b) not deadlocks

c) fatal

d) none of the mentioned

Answer: b

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

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

7. The Banker’s algorithm is _____________ than the resource allocation graph algorithm.

a) less efficient

b) more efficient

c) equal

d) none of the mentioned

Answer: a

8. The data structures available in the Banker’s algorithm are ____________

a) Available

b) Need

c) Allocation

d) All of the mentioned

Answer: d

9. The content of the matrix Need is ____________

a) Allocation – Available

b) Max – Available

c) Max – Allocation

d) Allocation – Max

Answer: c

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

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

Comments