00:01
Hello students, let's analyze the given processor and apply the fcfs that is the first come first serve and the primitive and the non -primitive shortest job first and the round robin using the scheduling algorithm.
00:16
So, first of all we will create the chain chart for each algorithm and then compare the average turnaround time and the waiting time.
00:22
So for the processor p1, we have an arriving time with the 0 and the burst time as 10.
00:29
And the processor p2 with the arriving time as the 1 and the burst time with the 2.
00:38
Processor p3 with the arriving time as 6 and the burst time as 3.
00:44
And the processor p4 with the arriving time of 12 and with the burst time of 15.
00:52
Now let's calculate the computation time, turnaround time and the waiting time for each process using the scheduling algorithm.
01:00
So first of all we will use the first come first serve that is the fcfs.
01:04
So the processor executed in the order of the array.
01:09
So that with the chain chart as with the p1, p2, p3 and p4 respectively with the 0, 10, 12, 15 and followed by the 27.
01:24
So here the completion time, the completion, the completion time are as for the p1 it takes the 10 to complete and then for the p2 it takes for 12 to complete.
01:40
For p2 it takes 12 minutes and for the p3 it takes the 15 and for the p4 it takes the 27.
01:49
So the turnaround time as we will calculate the turnaround time with respect to with its turn around time as the turnaround time is equal to completion time minus the arrival time.
02:05
So that will be as the p1, processor p1 will be 10 minus 0 so that is 10 and the p2 that is 12 minus 1 so that is 11 and for the processor 3 will be having 15 minus 6 so that is 9 and for the processor p4 that is 27 minus 12 that is 15.
02:26
That is 15 and now moving to the waiting time, moving to the waiting, waiting time...