Scribd
Upload
30 views2 pages

Bankers Algorithm Solution

Operating system notes

Uploaded by

varshithareddy816
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views2 pages

Bankers Algorithm Solution

Operating system notes

Uploaded by

varshithareddy816
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Banker's Algorithm Solution

Step (a): Calculate the Need Matrix

Need[i][j] = Max[i][j] - Allocation[i][j]

Process | Need (A, B, C, D)

--------|------------------

P0 |0000

P1 |0750

P2 |1002

P3 |0020

P4 |0642

Step (b): Check if the system is in a safe state

Initial Available Resources: A = [1, 5, 2, 0]

Safe Sequence Check:

1. P0: Need = [0, 0, 0, 0] <= Available = [1, 5, 2, 0] -> Allocate to P0 -> Update Available: [1, 5, 3, 2]

2. P2: Need = [1, 0, 0, 2] <= Available = [1, 5, 3, 2] -> Allocate to P2 -> Update Available: [2, 8, 8, 6]

3. P3: Need = [0, 0, 2, 0] <= Available = [2, 8, 8, 6] -> Allocate to P3 -> Update Available: [2, 14, 11, 8]

4. P4: Need = [0, 6, 4, 2] <= Available = [2, 14, 11, 8] -> Allocate to P4 -> Update Available: [2, 14, 12, 12]

5. P1: Need = [0, 7, 5, 0] <= Available = [2, 14, 12, 12] -> Allocate to P1 -> Update Available: [3, 14, 12, 12]

Safe Sequence: P0 -> P2 -> P3 -> P4 -> P1

Conclusion: The system is in a safe state.


Step (c): Handle the request from P1 for (0, 4, 2, 0)

Conditions to check:

1. Request <= Need: [0, 4, 2, 0] <= [0, 7, 5, 0] -> True

2. Request <= Available: [0, 4, 2, 0] <= [1, 5, 2, 0] -> True

Since both conditions are satisfied, the request can be granted immediately.

You might also like