Preemptive SJF Algorithm Results Assignment Answers
Your question:

part 4: Answer the following questions [4 marks] Three processes with process IDs P1, P2, P3 with estimated completion time 9, 5, 6 milliseconds respectively enter the ready queue together. A new process P4 with estimated completion time 1 ms enters the 'Ready' queue after 2 ms. A new process P5 with estimated completion time 2 ms enters the 'Ready' queue after 3 ms. Assume all the processes contain only CPU operation and no I/O operations are involved. Calculate the waiting time and Turn Around Time (TAT) for each process and the Average waiting time and Turn Around Time (Assuming there is no I/O waiting for the processes) in preemptive SJF based scheduling algorithm.
Assignment Help Answers with Step-by-Step Explanation:
P2: Estimated completion time = 5 ms
P3: Estimated completion time = 6 ms
2. P4 starts at time 2 and runs for 1 ms (preempted by P5).
3. P5 starts at time 3 and runs for 2 ms (completes).
Waiting time = (2 - 0) ms = 2 ms
TAT = (2 + 9) ms = 11 ms
Waiting time = (15 - 6) ms = 9 ms
TAT = (9 + 6) ms = 15 ms
Waiting time = (3 - 3) ms = 0 ms
TAT = (0 + 2) ms = 2 ms


