Directions (Q96–100): Processes with arrival time and CPU burst (ms): P1 (arrival 0, burst 5), P2 (2, 3), P3 (2, 2), P4 (5, 3), P5 (6, 1).
Calculate the average response time for these processes with 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).

Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. 5.6 ms
Explanation
All at time 0, by priority: P2 (0–3), P5 (3–4), P1 (4–9), P4 (9–12), P3 (12–14). Response times 0, 3, 4, 9, 12 sum to 28; average 28/5 = 5.6 ms.
More System Software and Operating System questions
- Match List - I with List - II. (D) Priority Scheduling (IV) Select the process for execution with smallest next Burst time.
- Match List - I with List - II.
- What is the significance of the Banker's algorithm in terms of resource management?
- The order of steps of Address Translation in Linux Virtual Memory Scheme will be : A. register B. offset C. Page directory. D. Page table E…
- Match List-I with List-II :
- Match List-I with List-II.