CSCE 311 Spring 2019 Process Scheduling Name: Due: 2/14/19 1. Assume that the following processes arrive at the times shown in the table below and with the indicated CPU burst. Process Arrival Time CPU Burst 15 16 P4 14 a) Assuming FCFS process scheduling, draw the Gant chart showing the order in which the processes execute. b) Assuming non-preemptive SJF scheduling, draw the Gant chart showing the order in which the processes execute. Assuming SJR (preemptive SJF) scheduling, draw the Gant chart showing the order in which the processes execute. c) Assuming RR scheduling with quantum processes execute. 4, draw the Gant chart showing the order in which the d) e) Assuming process priority Pl:0, P2:3, P3:2, P4:1, draw the Gant chart to show the priority higher priority) scheduling for these processes. (smaller number What is the average waiting time for each of the scheduling algorithms in question 1? a) 2. b) d) e)