Font size
WorksheetsOS QUIZ(UNIT-III)
Total questions: 10
Worksheet time: 6mins
Deadlocks can be described by which graph?
Resource Allocation Graph
Hamilton Graph
Directed Graph
Complete Graph
Which is deadlock avoidance algorithm
fcfs algorithm
bankers algorithm
preemptive algorithm
round robin algorithm
Which is not a necessary condition in Deadlock
mutual exclusion
hold and wait
circular wait
progress
If p1 requesting for r1,r1 allocated to p2,p2 reqesting for r2,r2 is allocated to p1 such condition is called as______ in Deadlock Prevention
mutual exclusion
hold and wait
circular wait
bounding condition
Banker's algorithm for resource allocation deals with?
Deadlock prevention
Deadlock Recovery
Deadlock Avoidance
Circular Wait
If there is a direct arc from Process node to resource node we call that edge in RAG graph to be as
assigned edge
claimed edge
request edge
none of them
If there is a direct arc from resource node to Process node than we call that edge in RAG graph to be as
assigned edge
claimed edge
request edge
none of them
What is the maximum number of processes that may enter simultaneously inside the critical section to avoid race condition?
1
2
3
4
(a) is the edge which is made dotted arc from process node to resource node in RAG to avoid deadlocks.
Resource in RAG is represented in terms of (a) .
