$3.$ a$.$ Consider two processes, $\backslash ($ P $1\backslash )$ and $\backslash ($ P $2\backslash ),$ where $\backslash ($ p $1=40,$ t $1=15,$ p $2=70\backslash ),$ and $\backslash ($ R$=35\backslash ).$

i$.$ Can these two processes be scheduled using rate$-$monotonic scheduling? Illustrate your answer using a Gantt chart.

ii$.$Illustrate the scheduling of these two processes using earliest$-$deadline$-$fist $($EDF$)$ scheduling.

$6.$ Consider three CPU$-$intensive processes, which require $11,22$ and $33$ time units and arrive at times $0,3$ and $7,$ respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.

i$.1$

ii$.2$

iii. $3$

iv$.4.$

$[1\mathrm{.}5]$

c$.$ Which of the following statements is not true for Multi$-$Level Feedback Queue processor scheduling algorithm?

$($A$)$ Processes are permanently assigned to a queue

$($B$)$ Each queue may have different scheduling algorithm

$($C$)$ Queues have different priorities

$($D$)$ This algorithm can be configured to match a specific system under design. $[1]$

A$.$ Which of the following scheduling algorithms could result in starvation? Which of the following is preemptive, non$-$preemptive, or can be both preemptive and non$-$preemptive. $[3\mathrm{.}5]$

i$.$ First$-$come, first$-$served. ii$.$ Shortest$-$remaining$-$time$-$first. iii. Round robin. iv$.$ Priority.

Show all steps and workings with explanations

Continued to Next Page