Operating System

Consider the following snapshot of a system consisting of processes and resource allocation. There are five processes P0, P1, P2, P3, P4 and four resource types A, B, C, D (Say A is printing, B is memory, etc) . Their allocation, max, and available are shown in the following table.

Processes Allocation Max Available

A B C D A B C D A B C D

P0 0 0 1 2 0 0 1 2 1 5 2 0

P1 1 0 0 0 1 7 5 0

P2 1 3 5 4 2 3 5 6

P3 0 6 3 2 0 6 5 2

P4 0 0 1 4 0 6 5 6

Answer the following questions using the bankers algorithm:

a. What is the content of the matrix Need? [5]

b. Is the system in a safe state or not? If it is, show how the processes can complete. If not, show how they can deadlock. Show your computation step-by-step. [10]

d. If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately? Give detailed explanation.