(a) Using SJF (Preemptive and Non-Preemptive) calculate Average Waiting Time and also draw GANTT Chart for both modes. (10)

Process Arrival Time Burst Time

P₁ 0.0 7

P₂ 2.0 4

P₃ 4.0 1

P₄ 5.0 4

(b) Explain Bankers Algorithm, Calculate the remaining need of resources required by the processes and draw a list of available resources for the situation given below, also draw safe sequence of processes. (10)

(Total Resources: A=10, B=5, C=7)

Process No. Allocated Resources Max. Need

A B C A B C

1 0 1 0 7 5 3

2 2 0 0 3 2 2

3 3 0 2 9 0 2

4 2 1 1 4 2 2

5 0 0 2 5 3 3