Question

Table 1 shows the list of processes and burst time for each processes

Table 1

 

Process	Burst Time
P1	13
P2	5
P3	23
P4	3
P5	31
P6	6
P7	14

 

The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5, P6 and P7 all at  time 0.

 

a)    Calculate the average waiting time when each of the below scheduling algorithm is used. Assume that a quantum 8 is being used:

i.) First Come, First Server                                                                      (6 marks)

ii.) Round Robin                                                                                       (6 marks)

iii.) Shortest Job First, non preemptive                                                      (6 marks)