Problem $2$

$-$ Consider scheduling three processes, which arrive in the following order at time $0$ :

$-$ Process A: uses $1,000$ ms of CPU time, never blocks for I$/$O

$-$ Process B: uses $100$ ms total CPU time, blocks for I$/$O every $10$ ms

$-$ Process C: uses $100$ ms total of CPU time, blocks for I$/$O every $20$ ms

$-$ Find the turnaround time for each process, and the average turnaround time for all processes, using each of the following scheduling algorithms. Assume that I$/$O requests block for $10$ ms $.$

$-$ FCFS scheduling $($A$,$ B$,$ C order, non$-$preemptive$)$

$-$ Round$-$Robin scheduling $($time quantum of $10$ ms $)$

$-$ Shortest Process Next $($non$-$preemptive, time estimates are A $=1,000,$ B $=10,$ C $=20)$

$-$ Note: It will probably be easier if you break these problems into phases when working out your answers.