QUESTION ONE

I have just invented a new scheduling algorithm that I claim gives the highest priority to processes that have just entered the system but is fair to all processes. The algorithm works like this: There are two queues, one for new processes and one for old processes. When a process enters the system, it is put at the end of the new queue. After $?$ milliseconds on the new queue, whether a process has been scheduled or not, it is moved to the end of the old queue. When it is time to schedule a process, the system schedules the process at the head of one of the queues, alternating between the two queues. Each process runs to completion before the next process is scheduled. Assume that processes enter the system at random times and that most processes take much longer than $2$ milliseconds to execute.

a$)$ Does this algorithm give the highest priority to new processes? Explain your answer. $[4$ marks$]$

b$)$ Is this algorithm starvation$-$free? Explain your answer$[3$ marks$]$

c$)$ Discuss whether this algorithm is fair to all processes. By "fair" we mean every process has a wait time approximately equal to the average wait time, assuming all processes have close to the same execution time. $[3$ marks$]$