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 |
Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority).
| Process | Arrival Time | Burst Time |
| P1 | 5 | 3 |
| P2 | 3 | 1 |
| P3 | 2 | 5 |
| P4 | 3 | 4 |
| P5 | 1 | 2 |
1
5.6 ms
2
5.2 ms
3
4.7 ms
4
3.8 ms