Banker's Algorithm: 5 processes P₀ through P₄; 3 resource types A (10 instances), B (5 instances), and C (7 instances). (a) Need matrix (b) Safe…
Banker's Algorithm: 5 processes P₀ through P₄; 3 resource types A (10 instances), B (5 instances), and C (7 instances).
(a) Need matrix
(b) Safe state or Unsafe
Snapshot at time T₀:
| Allocation A B C | Max A B C | Available A B C | |
| P₀ | 0 1 0 | 7 5 3 | 3 3 2 |
| P₁ | 2 0 0 | 3 2 2 | |
| P₂ | 3 0 2 | 9 0 2 | |
| P₃ | 2 1 1 | 2 2 2 | |
| P₄ | 0 0 2 | 4 3 3 |
From the BB Assistant Director (ICT) February 2025 – Written (DU) exam, question 49 of 55.
More from this paper
- Previous: What is Total Latency for a 3-kbyte message (an e-mail) if the bandwidth of the network is 1Gbps? Assume that the distance between the…
- Next: Construct a min heap from the given values: 12, 29, 33, 56, 66, 99, 100, and 344.
- All questions in BB Assistant Director (ICT) February 2025 – Written (DU)