Operating System Deadlock Detection
Q The wait-for graph is a deadlock detection algorithm that is applicable when ____________
  • A A. All resources have a single instance
  • B B. All resources have multiple instances
  • C C. All resources have a single 7 multiple instances
  • D D. All of the mentioned
Leave a Comment