Nov2017 cs Q49

0. Consider the following four processes with the arrival time and length of CPU burst given in milliseconds :
ProcessArrival TimeBurst Time
P108
P214
P329
P435
 The average waiting time for preemptive SJF scheduling algorithm is __________.

  • Option : A
  • Explanation :
    First we will make gantt chart of given process then we will calculate turn around time and waiting time of individual process.
    Nov2017 cs
    Now we have to calculate average waiting time for schedule:
    avg waiting time = wt(P1 + P2 + P3 + P4 )/number of process.
    ie. (9 + 0 + 15 + 2) / 4
    = 26 / 4
    = 6.5
    So, option (A) is correct.
Cancel reply

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


Cancel reply

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