Example of Banker's Algorithm

$5$ processes $P_0$ through $P_4$;

$3$ resource types:

$A(10$ instances$),B(5$ instances$),$ and $C(7$ instances$)$

Snapshot at time $T_0$ :

$\backslash$table$[[,$Allocation,Max,Available$],[,$ABC,ABC,ABC