a$)$ Consider a system which uses Banker's algorithm is deal with deadlock situation. The

current state of the system is such that it has five processes and four resources. The

snapshot of this system with Maximum Claim, Allocation and availability of resources

are indicated in the form of matrices is shown below.

Maximum Claim

Allocation

Available

Calculate the following:

i$.$ Need Matrix $[1$M$]$

ii$.$ Find out whether the system is in safe state or not. If it is in safe state then

show the safe sequence. Show all calculations. $[3$M$]$

iii. Suppose process P$3$ makes a request for resources as $(0,1,0,0).$ Can this

request be safely granted immediately? If so$,$ what will be the safe sequence?

$1M$

b$)$ Draw a wait for graph for the following resource allocation graph which consists of

processes $($indicated as circles$)$ and resources $($indicated as square$).$ Also find out whether

there exist any cycle or not. If there is cycle, then show the sequence of processes in

which cycle exist. $[2$M$]$

c$)$ List two techniques which are used to enhance the performance of SISD system. $[1$M$]$