Deadlock Detection MCQ

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

• ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock ____________
  ক

  can never occur

  খ

  may occur

  গ

  has to occur

  ঘ

  none of the mentioned
• A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________
  ক

  can never occur

  খ

  may occur

  গ

  has to occur

  ঘ

  none of the mentioned
• A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?
  ক

  2

  খ

  3

  গ

  4

  ঘ

  1
• Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________
  ক

  the set of processes that have been deadlocked

  খ

  the set of processes in the deadlock queue

  গ

  the specific process that caused the deadlock

  ঘ

  all of the mentioned
• A deadlock eventually cripples system throughput and will cause the CPU utilization to ______
  ক

  increase

  খ

  drop

  গ

  stay still

  ঘ

  none of the mentioned
• What is the disadvantage of invoking the detection algorithm for every request?
  ক

  overhead of the detection algorithm due to consumption of memory

  খ

  excessive time consumed in the request to be allocated memory

  গ

  considerable overhead in computation time

  ঘ

  all of the mentioned
• If deadlocks occur frequently, the detection algorithm must be invoked ________
  ক

  rarely

  খ

  frequently

  গ

  rarely & frequently

  ঘ

  none of the mentioned
• If the wait for graph contains a cycle ____________
  ক

  then a deadlock does not exist

  খ

  then a deadlock exists

  গ

  then the system is in a safe state

  ঘ

  either deadlock exists or system is in a safe state
• An edge from process Pi to Pj in a wait for graph indicates that ____________
  ক

  Pi is waiting for Pj to release a resource that Pi needs

  খ

  Pj is waiting for Pi to release a resource that Pj needs

  গ

  Pi is waiting for Pj to leave the system

  ঘ

  Pj is waiting for Pi to leave the system
• The wait-for graph is a deadlock detection algorithm that is applicable when ____________
  ক

  all resources have a single instance

  খ

  all resources have multiple instances

  গ

  all resources have a single 7 multiple instances

  ঘ

  all of the mentioned