Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Operating Systems CPU Scheduling Process Scheduling
Consider the following three processes with the arrival time and CPU burst time given in
milliseconds:
|
Process |
Arrival Time |
Burst Time |
|
P1 |
0 |
7 |
|
P2 |
1 |
4 |
|
P3 |
2 |
8 |
The Gantt Chart for preemptive SJF scheduling algorithm is
1
2
3
4