Operating Systems20815 marksNumerical: Priority scheduling algorithmVideo solutionProcess Scheduling
Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario:
Calculate the average waiting time and turnaround time using priority algorithm (Priority 1 being the highest) for the given scenario:
$$\begin{array}{|c|c|c|c|} \hline \text{PID} & \text{Burst Time} & \text{Arrival Time} & \text{Priority} \ \hline A & 3 & 0 & 3 \ B & 2 & 2 & 3 \ C & 4 & 3 & 2 \ D & 2 & 3 & 1 \ \hline \end{array}$$
[5]
Video solutionPriority Scheduling: Average Waiting and Turnaround Time2:31
Speed
Checked against the model answer before publishing.
PID Burst Time Arrival Time Priority ---------------------------------------- A 3 0 3 B 2 2 3 C 4 3 2 D 2 3 1 Priority 1 = highest. Assume non-preemptive priority scheduling. --- - t = 0: Only A available → A runs 0 to 3. - t = 3: Ready = B (P3), C (P2), D (P1). Highest priority = D → D runs 3 to...