CPU SCHEDULING ALGORITHM PRACTICE QUESTION
1) Consider a system with 3 resources (A, B, C) in quantity (7, 6, 7). The Banker's Algorithm is used to allocate resources and it has the following SAFE state
Process
Allocation Max ABC ABC 1 0 2 2 0 1 0 2 1 3 2 6 6 5 0 2 2 0 5 3
Need ABC 1 1 4 1 1 3 5 3 3 1
Available: A B C 3 2 1
PO P1 P2 P3
a) Justify why the current state is safe. b) If P0 requests an additional unit of resource B, will it be allowed? Justify your answer.