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 10 of 14

Explore more Topics under Operating System

Q91.
The wait-for graph is a deadlock detection algorithm that is applicable when :

a.

all resources have a single instance

b.

all resources have multiple instances

c.

all resources have a single 7 multiple instance

d.

all of the mentioned

Discuss
Answer: (a).all resources have a single instance
Q92.
An edge from process Pi to Pj in a wait for graph indicates that :

a.

Pi is waiting for Pj to release a resource that Pi needs

b.

Pj is waiting for Pi to release a resource that Pj needs

c.

Pi is waiting for Pj to leave the system

d.

Pj is waiting for Pi to leave the system

Discuss
Answer: (a).Pi is waiting for Pj to release a resource that Pi needs
Q93.
If the wait for graph contains a cycle :

a.

then a deadlock does not exist

b.

then a deadlock exists

c.

then the system is in a safe state

d.

either deadlock exists or system is in a safe state

Discuss
Answer: (b).then a deadlock exists
Q94.
If deadlocks occur frequently, the detection algorithm must be invoked ________

a.

rarely

b.

frequently

c.

rarely & frequently

d.

none of the mentioned

Discuss
Answer: (b).frequently
Q95.
The disadvantage of invoking the detection algorithm for every request is :

a.

overhead of the detection algorithm due to consumption of memory

b.

excessive time consumed in the request to be allocated memory

c.

considerable overhead in computation time

d.

all of the mentioned

Discuss
Answer: (c).considerable overhead in computation time
Q96.
A deadlock eventually cripples system throughput and will cause the CPU utilization to ______

a.

increase

b.

drop

c.

stay still

d.

none of the mentioned

Discuss
Answer: (b).drop
Q97.
Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify :

a.

the set of processes that have been deadlocked

b.

the set of processes in the deadlock queue

c.

the specific process that caused the deadlock

d.

all of the mentioned

Discuss
Answer: (a).the set of processes that have been deadlocked
Q98.
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.

2

b.

3

c.

4

d.

1

Discuss
Answer: (a).2
Q99.
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock :

a.

can never occur

b.

may occur

c.

has to occur

d.

none of the mentioned

Discuss
Answer: (a).can never occur
Q100.
‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock :

a.

can never occur

b.

may occur

c.

has to occur

d.

none of the mentioned

Discuss
Answer: (a).can never occur
Page 10 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!

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

C Programming

Master one of the most widely used programming languages with our C Programming MCQs....

R Programming

Unleash the power of statistical computing with our R Programming MCQs. Topics cover...

Digital Logic Design

Understand the foundation of digital computers with our Digital Logic Design MCQs....