Consider the following set of processes with the arrival time and length of…
PYQ UGC NET 2024
Consider the following set of processes with the arrival time and length of CPU Burst time given in milli-seconds (ms):
Process | Arrival Time | Burst Time |
P₁ | 0 | 5 |
P₂ | 2 | 3 |
P₃ | 2 | 2 |
P₄ | 5 | 3 |
P₅ | 6 | 1 |
Process | Burst Time | Priority |
P₁ | 5 | 3 |
P₂ | 3 | 1 |
P₃ | 2 | 5 |
P₄ | 3 | 4 |
P₅ | 1 | 2 |
Calculate the average response time for these processes with non preemptive priority Scheduling algorithm?
Priority of the processes are as follows and consider that all the processes came at zero (0) time. (Note: low numbers represent high priority).
- A.
5.6 ms
- B.
5.2 ms
- C.
4.7 ms
- D.
3.8 ms
Attempted by 266 students.
Sign up free to check your answer
Sign up freeLoading lesson…

