Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Operating Systems CPU Scheduling Process Scheduling
Comprehension Passage
Consider the following set of processes with the arrival time and length of CPU burst time given in milli secends (ms)
| Process | Arrival Time | Burst Time |
| P1 | 0 | 5 |
| P2 | 2 | 3 |
| P3 | 2 | 2 |
| P4 | 5 | 3 |
| P5 | 6 | 1 |
When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
1
Round Robin
2
Priority
3
Highest Response ratio Next
4
Least Completed next