The project is a simulation for some of the CPU scheduling algorithms and making a comparison between them. The project will:

$$ Simulates the CPU scheduling algorithms FCFS$,$ SRTF $($SJF with preemption$),$ RR$,$ Multilevel Feedback Queues.

$$ Creates $8$ processes in the ready queue with a random CPU$-$burst for each process between $5$ & $100$ time units. You should use a suitable data structure for each process representing in a way the PCB which may contain the data you think you need it in your program.

$$ When creating the processes, assign some kind of order $($arrival time$)$ for their arrival.

$$ For RR$,$ use a slice time $($quantum$,$ Q $=20$ units$).$

$$ In multilevel feedback Queue, consider $3$ queues,

Q$1$: RR with $10$ units

Q$2$: RR with $50$ units.

Q$3$: FCFS

$$ For each of the scheduling algorithms above, you should compute the average turnaround time $($ATT$)$ and average waiting time $($AWT$).$

$$ Repeat steps $(2)$ to $(6)$ for $100$ times, $1000$ times, $10000$ times, and $10000$ times.

$$ Create a table summarizing your results showing ATT & AWT for all cases:

For example, in case FCFS:

No$.$ of iterations

$100100010000100000$

ATT

AWT

FCFS

$(*)$ Same thing for SJF$,$ RR$,$ Multilevel Feedback Queues.