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

Explore more Topics under Operating System

Q1.
With deadlock detection, requested resources are granted to

a.

Resources

b.

Programs

c.

Processes

d.

Users

Discuss
Answer: (c).Processes
Q2.
A set of processes is deadlock if

a.

each process is blocked and will remain so forever

b.

each process is terminated

c.

all processes are trying to kill each other

d.

none of the mentioned

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
Q4.
With a single resource, deadlock occurs

a.

if there are more than two processes competing for that resource

b.

if there are only two processes competing for that resource

c.

if there is a single process competing for that resource

d.

none of these

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

a.

deadlocked state is unsafe

b.

unsafe state may lead to a deadlock situation

c.

deadlocked state is a subset of unsafe state

d.

all of these

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

a.

deadlock can never occur

b.

deadlock may occur

c.

deadlock has to occur

d.

none of these

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

a.

11

b.

12

c.

13

d.

14

Discuss
Answer: (a).11
Q9.
The methods for dealing with the deadlock problem is

a.

Use a protocol to make sure that the system never enters in to the deadlock state.

b.

Allow the system to enter a deadlock state and then recover.

c.

Ignore the problem, and pretend that deadlocks never occur in the system. The UNIX operating system uses this solution.

d.

all of these

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

a.

deadlock can never occur

b.

deadlock may occur

c.

deadlock has to occur

d.

none of these

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!

Computer Graphics

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

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

DBMS

Get a firm grasp on database systems with our DBMS MCQs. Explore relational...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Big Data Computing

Enhance your understanding of Big Data Computing with our comprehensive MCQs. Explore...