Skills101
← All practice quizzes

Quiz: Deadlocks

5 questionsNo time limitPass: 60%+10 XP on first pass

When processes wait for each other forever. Coffman's four conditions, resource allocation graphs, prevention, avoidance with the Banker's algorithm (fully solved), detection and recovery.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    Which is NOT one of the four necessary conditions for deadlock?

  2. Question 2

    In the Banker's algorithm, Need is calculated as:

  3. Question 3

    Always requesting resources in increasing numbered order prevents deadlock by breaking:

  4. Question 4

    An unsafe state means:

  5. Question 5

    Available = (2, 1), P has Allocation (1, 0) and Max (3, 2). Can P finish right now?