Topic 1: Simulation of CPU scheduling algorithms Process Scheduling Process Scheduling algorithms: Do 1 scheduling algorithm from Part A and 2 scheduling algorithms from Part B Part A a) Round Robin with Quantum 3 Part B b) Preemptive SJF c) Non Preemptive SJF d) Preemptive Priority e) Non Preemptive Priority Pre-assigned case 1. User should be able to enter the details about the processes such as Arrival Time, Burst Time, Priority, Time Quantum for Round Robin assigned at the beginning of simulation and the number of processes can range from 3 to 10 . 2. Executing the program should show the Gantt chart (visual form) of each algorithm. 3. Calculation of a) Turnaround time for each process b) Total and Average Turnaround time for the entire processes c) Waiting time for each process d) Total and Average Waiting time for the entire processes Assumption I. if SAME PRIORITY on current process ( in CPU) and new arrival process, NO PREEMPTION will be executed, TO REDUCE CONTEXT SWITCH II. if SAME Burst time on current process (in CPU) and new arrival process, NO PREEMPTION will be executed, TO REDUCE CONTEXT SWITCH III. if SAME PRIORITY for those processes in the ready poll, CHOOSE FCFS IV. if BURST TIME SAME for those processes in the ready poll, CHOOSE FCFS V. The lower the priority count, the higher the priority for a process