Question $38$

Answer saved Marked out of $2\mathrm{.}00$

Flag question

Suppose that the following processes arrive for execution at time zero. Use First Come First Service scheduling algorithm to find the waiting time for P$3.$

$\backslash$table$[[$Process$,$Burst Time$],[$P$1,7],[$P$2,15],[$P$3,5],[$P$4,12],[$P$5,2]]$

a$.27$

b$.14$

c$.20$

d$.7$

e$.22$