Question: answer the following about CPU schedualing algorithims b) Consider 3 processes arriving at time 0. Process . P2 P3 Burst Time 25 4 4 b1)
b) Consider 3 processes arriving at time 0. Process . P2 P3 Burst Time 25 4 4 b1) Round robin scheduling with time quantum=5 Gantt Chart. 52) Average Waiting time b3) Do you consider RR as preemptive or nonpreemptive algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
