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.

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

Explore more Topics under Operating System

01

Introduction to Operating Systems

02

OS Basics

03

System Calls

04

Processes and Threads

05

CPU Scheduling

06

Process Synchronization

07

Files Management

08

Storage Management

09

Mass Storage Structure

10

IO Systems

11

Protection and Security

12

Distributed Systems

13

Real Time Systems

14

Swapping

15

Virtual Memory

16

Page Replacement Algorithms

17

File System Implementation

18

Files and Directories

19

Linux System

20

Disk Operating System (DOS)

21

Unix System

22

Windows NT

23

Windows 2000 Server

24

Windows Operating System

Q31.

A solution to the Dining Philosophers Problem which avoids deadlock is

ensure that all philosophers pick up the left fork before the right fork

ensure that all philosophers pick up the right fork before the left fork

ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork

None of the above

Discuss

Answer: (c).ensure that one particular philosopher picks up the left fork before the right fork, and that all other philosophers pick up the right fork before the left fork

Q32.

Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes.
Suppose each process P[i] executes the following:
wait (m[i]);wait (m[(i+1) mode 4]);
.........
release (m[i]); release (m[(i+1)mod 4]);
This could cause

Thrashing

Deadlock

Starvation, but not deadlock

None of the above

Discuss

Answer: (b).Deadlock

Q33.

What are the necessary conditions to occur the deadlock?

Sharable resource, Hold and wait, Preemption, Circular wait.

Mutual exclusion, Hold and wait, No preemption, Circular wait.

Mutual exclusion, Hold and wait, Preemption, Circular wait.

None of the above.

Discuss

Answer: (b).Mutual exclusion, Hold and wait, No preemption, Circular wait.

Q34.

Deadlocks can be described by which graph?

Resource-Allocation Graph

Hamilton Graph

Complete Graph

None of the above.

Discuss

Answer: (a).Resource-Allocation Graph

Q35.

Choose the correct option regarding deadlock.

If a resource-allocation graph contains no cycles, then no process in the system is deadlocked.

If the graph does contain a cycle, then a deadlock may exist.

Only a

Both a and b are correct.

Discuss

Answer: (d).Both a and b are correct.

Q36.

Which of the following is deadlock avoidance algorithm?

round-robin algorithm

banker's algorithm

Multilevel feedback

None of the above.

Discuss

Answer: (b).banker's algorithm

Q37.

In a graph the number of vertices of odd degree is always

even

odd

sometimes odd sometimes even

None of the above.

Discuss

Answer: (a).even

Q38.

Consider a computer system with 6 tape drives and 'n' processes completing for them. What is the maximum value of 'n' for the system to be deadlock free? (Assuming that each processes may need 3 tape drives)

Discuss

Answer: (b).2

Q39.

A system has 'm' number of resources of same type and 3 processes A, B, C. Share these resources A, B, C which have the peak demand of 3, 4 and 6 respectively. Deadlock will not occur if the value of 'm' is __________.

m = 15

m = 8

m = 13

m = 9

Discuss

Answer: (c).m = 13

Q40.

Which of the following statements is not valid for deadlock prevention scheme?

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

Request and all required resources be allocated before execution.

Release all resources before requesting a new resource.

Never request a resource after releasing any resource.

Discuss

Answer: (d).Never request a resource after releasing any resource.

Page 4 of 14

Welcome to the Deadlocks MCQs Page

Deadlocks MCQs | Page 4 of 14

Explore more Topics under Operating System

Introduction to Operating Systems

OS Basics

System Calls

Processes and Threads

CPU Scheduling

Process Synchronization

Files Management

Storage Management

Mass Storage Structure

IO Systems

Protection and Security

Distributed Systems

Real Time Systems

Swapping

Virtual Memory

Page Replacement Algorithms

File System Implementation

Files and Directories

Linux System

Disk Operating System (DOS)

Unix System

Windows NT

Windows 2000 Server

Windows Operating System

Suggested Topics

Data Structures and Algorithms

MySQL Database

Artificial Intelligence

Web Technologies

Software Architecture and Design

Object Oriented Programming Using C++

Digital Logic Design

DBMS

PHP