1: Fill in the need row for each process. PO P1 P2 Allocation ABC 021 100...

 

Transcribed Image Text:

1: Fill in the need row for each process. PO P1 P2 Allocation ABC 021 100 201 020 112 Max ABC 641 222 813 334 122 Available ABC 442 P3 P4 Activity 2: Draw a resource allocation graph for the system. Activity 3: Using the Banker's algorithm, specifically, the Safety "subalgorithm", is the system in a safe state? If it is, identify a safe sequence. Activity 4: Consider the following state of a system: PO P1 P2 P3 Need ABC P4 Allocation Request Available ABC ABC ABC 001 000 000 020 220 330 000 121 010 200 200 1: Fill in the need row for each process. PO P1 P2 Allocation ABC 021 100 201 020 112 Max ABC 641 222 813 334 122 Available ABC 442 P3 P4 Activity 2: Draw a resource allocation graph for the system. Activity 3: Using the Banker's algorithm, specifically, the Safety "subalgorithm", is the system in a safe state? If it is, identify a safe sequence. Activity 4: Consider the following state of a system: PO P1 P2 P3 Need ABC P4 Allocation Request Available ABC ABC ABC 001 000 000 020 220 330 000 121 010 200 200