Crowdly
Add to Chrome
You are given the following processes: For each of these scheduling algorith...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
You are given the following processes:
Process
|
Arrival time
|
Burst time
|
Priority
|
P1
|
0 ms
|
4 ms
|
2
|
P2
|
1 ms
|
3 ms
|
1
|
P3
|
2 ms
|
5 ms
|
3
|
P4
|
3 ms
|
2 ms
|
2
|
P5
|
6 ms
|
3 ms
|
1
|
For each of these scheduling algorithms:
- Priority Scheduling (preemptive + FIFO in case of similar priorities)
- Round Robin (quantum = 3 ms)
Write the execution order of processes as a sequence of time intervals.
Example format: FIFO: P1(0–8), P2(8–12), P3(12–21), ...
Note: We assume that low numbers represent high priority (P3 has the lowest priority here).
For each algorithm, compute the average waiting time. Which scheduling algorithm minimizes waiting time?