Operating System Deadlock Avoidance
Q 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.
  • A A. Minimum
  • B B. Average
  • C C. Maximum
  • D D. Approximate
Leave a Comment