Answer all questions

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