Menu Close

Assignment one Process Scheduling example

Consider the following five processes arriving at time 0

Process Burst Time Priority
P1 8 4
P2 6 1
P3 1 2
P4 9 2
P5 3 3

Calculate the average waiting time for FCFS, SJF, Priority based and RR, and figure out which algorithm gives the best average waiting time in the above scenario.


Deadline March 5 before class e.g. 1800 hrs 

Leave a Reply

Your email address will not be published. Required fields are marked *