Operating Systems

Q1- Using the following processes in the table below with their burst time for execution, do the 40 Marks foll wina. 1- Using FCFS, draw the algorithm Gantt chart anu cur average waiting time. ( suppose arrival time =0 ) 2- If the order of the processes has changed to P3,P5,P0,P2,P1,P4,P6, Which order is better and why? 3- Preemptive SJF, draw the algorithm Gantt chart and calculate the turnaround time and average waiting time. 4- Using round-robin scheduling with quantum=10, draw the algorithm Gantt chart and calculate the turnaround time and average waiting time. 5- Which algorithm from the above is better and why