adplus-dvertising

Welcome to the Deadlocks MCQs Page

Dive deep into the fascinating world of Deadlocks with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Deadlocks, a crucial aspect of Operating System. In this section, you will encounter a diverse range of MCQs that cover various aspects of Deadlocks, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Operating System.

frame-decoration

Check out the MCQs below to embark on an enriching journey through Deadlocks. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Operating System.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Deadlocks. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Deadlocks MCQs | Page 1 of 14

Q1.
With deadlock detection, requested resources are granted to
Discuss
Answer: (c).Processes
Discuss
Answer: (a).each process is blocked and will remain so forever
Q3.
To avoid the race condition, the number of processes that may be simultaneously inside their critical section is

a.

8

b.

1

c.

16

d.

0

Discuss
Answer: (b).1
Discuss
Answer: (d).none of these
Q5.
A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then
Discuss
Answer: (d).all of these
Q6.
 A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

a.

4

b.

3

c.

2

d.

1

Discuss
Answer: (c).2
Q7.
'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up
Discuss
Answer: (a).deadlock can never occur
Q8.
Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is
Discuss
Answer: (a).11
Discuss
Answer: (d).all of these
Q10.
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then
Discuss
Answer: (a).deadlock can never occur
Page 1 of 14

Suggested Topics

Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!