(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 P1 0.0 7 P2 2.0 4 P3 4.0 1 P4 5.0 4 (b) Explain Banker’s Algorithm, Calculate The Remaining Need Of

匿名用户 最后更新于 2021-11-29 17:10 计算机类Computing

(a) UsingSJF (Preemptive and Non-Preemptive) calculate Average Waiting Timeand also draw GANTT Chart for bothmodes.(10)

ProcessArrival Time BurstTime

P10.0 7

P22.0 4

P34.0 1

P45.0 4

(b) ExplainBanker’s Algorithm, Calculate theremaining need of resources required by the processes and draw alist of available resources for the situation given below, alsodraw safe sequence ofprocesses. (10)

(TotalResources:A=10, B=5,C=7)

ProcessNo.AllocatedResourcesMax. Need

ABCABC

1010753

2200322

3302902

4211422

5002533

已邀请: