For the following dataset, compute average waiting time for SRTN and S | Operating Systems 2079

Operating Systems20795 marksNumerical: SRTN and SJF schedulingVideo solutionProcess Scheduling

For the following dataset, compute average waiting time for SRTN and SJF.

Process	Arrival Time	Burst Time
P0	0	7
P1	2	4
P2	4	1
P3	5	4

[5]

Video solutionSRTN and SJF: Average Waiting Time2:56

Speed

Checked against the model answer before publishing.

Process Arrival Time Burst Time ---------------------------------- P0 0 7 P1 2 4 P2 4 1 P3 5 4 All required data present. --- At each new arrival, compare remaining times and run the smallest. - t=0: Only P0. Run P0. - t=2: P1 arrives (4). P0 remaining = 5. Since 4 < 5, run P1. (P0 rem = 5) - t=4...

← PreviousAll questions Next question →

Up nextDiscuss the advantages disadvantages of implementing file system using Linked List.

For the following dataset, compute average waiting time for SRTN and SJF. | Process | Arrival Time | Burst Time | |---------|--------------|------------| | P0 | 0 | 7 | | P1 | 2 | 4 | | P2 | 4 | 1 | | P3 | 5 | 4 |