Question: Process Burst Time (ms) Priority Arrival time (ms) P1 10 3 0 P2 2 1 1 P3 4 3 2 P4 1 4 3 P5

Process Burst Time (ms) Priority Arrival time (ms)
P1 10 3 0
P2 2 1 1
P3 4 3 2
P4 1 4 3
P5 6 2 4

1.What is the average waiting time if RR (quantum = 1) algorithm is used? Ignore the arrival delay.

2.What is the average waiting time if RR (quantum = 2) algorithm is used? Ignore the arrival delay.

3.What is the average waiting time if processes arrive in the reverse order (P5, P4, ... , P1) and RR (quantum = 2) algorithm is used? Ignore the arrival delay.

4.What is the average waiting time if RR (quantum = 4) algorithm is used? Ignore the arrival delay.

5.What is the average waiting time if processes arrive in the reverse order (P5, P4, ... , P1) and RR (quantum = 4) algorithm is used? Ignore the arrival delay.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!