Three processes $P_{1},P_{2},P_{3}$ share two resource types $A$ (3 instances) and $B$ (2 instances). The current allocation and maximum demand are:

Allocation matrix (rows processes, columns A,B):
$P_{1}: (1,0)$
$P_{2}: (0,1)$
$P_{3}: (1,1)$

Maximum demand matrix:
$P_{1}: (2,1)$
$P_{2}: (1,2)$
$P_{3}: (2,2)$

Using the Banker's algorithm, determine whether the system is in a safe state. If it is safe, give one safe sequence; if not, state that it is unsafe.

Question

Three processes $P_{1},P_{2},P_{3}$ share two resource types $A$ (3 instances) and $B$ (2 instances). The current allocation and maximum demand are:

Allocation matrix (rows processes, columns A,B):
$P_{1}: (1,0)$
$P_{2}: (0,1)$
$P_{3}: (1,1)$

Maximum demand matrix:
$P_{1}: (2,1)$
$P_{2}: (1,2)$
$P_{3}: (2,2)$

Using the Banker's algorithm, determine whether the system is in a safe state. If it is safe, give one safe sequence; if not, state that it is unsafe.

Accepted Answer

The system is not in a safe state.

City Guilds Model Questions Vol1 2024 Information Technology Question 43

Answer Options

About This Question

Master the Exam!