Question
a.
Mutual exclusion
b.
Hold and Wait
c.
Circular Wait
d.
No Preemption
Posted under Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration....
Similar Questions
Discover Related MCQs
Q. Banker's algorithm for resource allocation deals with ?
View solution
Q. What is the maximum number of processes that may enter simultaneously inside the critical section to avoid race condition ?
View solution
Q. What are global locks ?
View solution
Q. Semophores are used to solve the problem of
View solution
Q. Semaphores function is to
View solution
Q. Four necessary conditions for deadlock are non pre-emption, circular wait, hold and wait and
View solution
Q. Banker's algorithm deals with
View solution
Q. Which of following is not a condition of Dead Lock ?
View solution
Q. A solution to the Dining Philosophers Problem which avoids deadlock is
View solution
Q. 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
View solution
Q. What are the necessary conditions to occur the deadlock?
View solution
Q. Deadlocks can be described by which graph?
View solution
Q. Choose the correct option regarding deadlock.
View solution
Q. Which of the following is deadlock avoidance algorithm?
View solution
Q. In a graph the number of vertices of odd degree is always
View solution
Q. 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)
View solution
Q. 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 __________.
View solution
Q. Which of the following statements is not valid for deadlock prevention scheme?
View solution
Q. Which of the following statements is not true for the deadlock prevention and deadlock avoidance schemes?
View solution
Q. In an undirected graph, the sum of degrees of all vertices is
View solution
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!
