------------------------------------------------------------------------------
MC logo
Banker's Algorithm Problems
[^] Recommended Problems
------------------------------------------------------------------------------ Consider the following system state.

There are three resources and three processes.

Resources:
R1R2R3
425
Available:
R1R2R3
212

Claim matrix:
R1R2R3
P1 212
P2 324
P3 421
Allocation matrix:
R1R2R3
P1 101
P2 001
P3 111

The state is safe. Consider each of the following requests and say if they can be granted.

o P3 requests 1 0 0
o P2 requests 2 0 0
o P1 requests 0 1 0
o P2 requests 1 0 1