K22YG 2

What is a reusable resource?

• that can be used by one process at a time and is not depleted by that use
  

• that can be used by more than one process at a time

• that can be shared between various threads

• none of the mentioned

Which of the folowing is not a necesessary condition for deadlock.

• Mutual exclusion
• Hold and wait
• Circular wait
• Resource preemption

A system is in the safe state if ____________

• the system can allocate resources to each process in some order and still avoid a deadlock

• there exist a safe sequence

• all of the mentioned

• none of the mentioned

Which one of the following is the deadlock avoidance algorithm?

• banker’s algorithm

• round-robin algorithm

• elevator algorithm

• karn’s algorithm

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

• none of the mentioned

• inversion graph

• starvation graph

• resource allocation graph

What is the drawback of Ostrich  algorithm?

• Limited fault tolerance
• Lack of scalability
• Inefficient resource utilization
• Delay in problem detection and response

The resource allocation graph algorithm is not applicable where resource have __________. 

• 1. rare instances

• 2. multiple instances

• 1. single instance 

• 1. zero instance

A resource type, R is represented by 3-dots, it has

• 2 instances
  

• 6 instances

• 4 instances

• 3 instances

Another variant of RAG is

• Call graph
  

• Wait-for graph
  

• Shortest path graph
  

• None of the above

A set of resource allocation such that the system can allocate resources to each process in some order and still avoid deadlock is

• Deadlock state
• Unstable state
• Inconsistent state
• Safe state