Back to the 2019 paper

Module 4: Deadlocks

201914m

Define deadlock. List four necessary conditions for occurrence of deadlock.

A system contains six units of resource, and n processes that use the resource. What is the maximum value of n for which the system will be deadlock free if the maximum requirement of each process is 3?

Worked SolutionAI Assisted

Deadlock Definition & Conditions

Deadlock = set of processes blocked each waiting for resource held by another, circular wait.
Four Coffman conditions: Mutual Exclusion, Hold-and-Wait, No Preemption, Circular Wait.
Max n for 6 units, need 3 per process: For deadlock-free, n*(need-1)+1 ≤6 → n*2+1≤6 → n≤2 (integer). So n=2 deadlock-free, n=3 may deadlock. Some texts give n=2.

Similar questions

AI LearningWeb Platform

Coursify — Personal AI Course Generator

Struggling with a difficult subject or concept? Turn any engineering topic into a structured course with interactive lessons, quizzes, and research-backed explanations.