Deadlock Avoidance MCQ

Test your knowledge with important Deadlock Avoidance MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Deadlock Avoidance MCQs at Bissoy

• The content of the matrix Need is ____________
  ক

  Allocation – Available

  খ

  Max – Available

  গ

  Max – Allocation

  ঘ

  Allocation – Max
• The data structures available in the Banker’s algorithm are ____________
  ক

  Available

  খ

  Need

  গ

  Allocation

  ঘ

  All of the mentioned
• The Banker’s algorithm is _____________ than the resource allocation graph algorithm.
  ক

  less efficient

  খ

  more efficient

  গ

  equal

  ঘ

  none of the mentioned
• The resource allocation graph is not applicable to a resource allocation system ____________
  ক

  with multiple instances of each resource type

  খ

  with a single instance of each resource type

  গ

  single & multiple instances of each resource type

  ঘ

  none of the mentioned
• If no cycle exists in the resource allocation graph ____________
  ক

  then the system will not be in a safe state

  খ

  then the system will be in a safe state

  গ

  all of the mentioned

  ঘ

  none of the mentioned
• All unsafe states are ____________
  ক

  deadlocks

  খ

  not deadlocks

  গ

  fatal

  ঘ

  none of the mentioned
• A system is in a safe state only if there exists a ____________
  ক

  safe allocation

  খ

  safe resource

  গ

  safe sequence

  ঘ

  all of the mentioned
• A state is safe, if ____________
  ক

  the system does not crash due to deadlock occurrence

  খ

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

  গ

  the state keeps the system protected and safe

  ঘ

  all of the mentioned
• Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.
  ক

  minimum

  খ

  average

  গ

  maximum

  ঘ

  approximate
• Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.
  ক

  resources currently available

  খ

  processes that have previously been in the system

  গ

  resources currently allocated to each process

  ঘ

  future requests and releases of each process