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

Explore more Topics under Operating System

Q41.
Which of the following statements is not true for the deadlock prevention and deadlock avoidance schemes?

a.

Deadlock avoidance is less restrictive than deadlock prevention.

b.

In deadlock prevention, the request for resources is always granted, if the resulting state is safe.

c.

It is the priority to have the knowledge of resource requirements for deadlock avoidance.

d.

In deadlock avoidance, the request for resources is always granted, if the resulting state is safe.

Discuss
Answer: (d).In deadlock avoidance, the request for resources is always granted, if the resulting state is safe.
Q42.
In an undirected graph, the sum of degrees of all vertices is

a.

Odd

b.

Even

c.

Even and odd both.

d.

None of the above.

Discuss
Answer: (b).Even
Q43.
From the following statements which one is not a valid deadlock prevention scheme?

a.

Number the resources uniquely and never request a lower numbered resource than the last one

b.

Release all the resources before requesting for a new resource

c.

Request all the resources before execution

d.

Never request a resource after releasing any resources

Discuss
Answer: (d).Never request a resource after releasing any resources
Q44.
 What is known as a race condition?

a.

When a deadlock occurs

b.

When it has a starvation and not a deadlock

c.

When the result of a computation depends on the speed of the processes involved

d.

When it cannot have a subroutine call.

Discuss
Answer: (c).When the result of a computation depends on the speed of the processes involved
Q45.
Which of the following approaches do not require knowledge of the system state?

a.

deadlock detection.

b.

deadlock prevention.

c.

deadlock avoidance.

d.

none of the above.

Discuss
Answer: (d).none of the above.
Q46.
An operating system contains 3 user processes each requiring 2 units of resource R .The minimum number of units of R such that no deadlocks will ever arise is

a.

4

b.

3

c.

5

d.

6

Discuss
Answer: (a).4
Q47.
Before proceeding with its execution, each process must acquire all the resources it needs is called

a.

hold and wait

b.

No pre-emption

c.

circular wait

d.

starvation

Discuss
Answer: (a).hold and wait
Q48.
To avoid race condition, the maximum number of processes that may be simultaneously inside the critical section is

a.

zero

b.

one

c.

two

d.

more than two

Discuss
Answer: (b).one
Q49.
Which of the following is not the approach to dealing with deadlock ?

a.

Prevention

b.

Avoidance

c.

Detection

d.

Deletion

Discuss
Answer: (d).Deletion
Q50.
Match the following.

i) Mutual exclusion a) A process may hold allocated resources while waiting assignment.
ii) Hold and wait b) No resource can be forcibly removed from a process holding it.
iii) No preemption c) Only one process may use a resource at a time.

a.

i-a, ii-b, iii-c

b.

i-a, ii-c, iii-b

c.

i-b, ii-c, iii-a

d.

i-c, ii-a, iii-b

Discuss
Answer: (d).i-c, ii-a, iii-b
Page 5 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!

Digital Logic Design

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

C Programming

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

Management Information Systems

Discover how businesses leverage technology with our Management Information Systems...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Java Programming

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

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Systems Programming

Decode low-level programming with our Systems Programming MCQs. These questions delve...

Computer Graphics

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