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

Explore more Topics under Operating System

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 
Discuss
Answer: (b).Deadlock 
Discuss
Answer: (b).Mutual exclusion, Hold and wait, No preemption, Circular wait.
Q34.
Deadlocks can be described by which graph?
Discuss
Answer: (a).Resource-Allocation Graph
Discuss
Answer: (d).Both a and b are correct.
Q36.
Which of the following is deadlock avoidance algorithm?
Discuss
Answer: (b).banker's algorithm
Q37.
 In a graph the number of vertices of odd degree is always
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)

a.

3

b.

2

c.

4

d.

7

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 __________.
Discuss
Answer: (c).m = 13
Discuss
Answer: (d).Never request a resource after releasing any resource.

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!