GLG 101 Lecture Notes - San Francisco State University, Gantt Chart
San Francisco State University
CSC 415 – Operating Systems
Name : ______________________
Student ID : ______________________
1. Using the First Come First Serve Scheduling algorithm, show the Gantt chart for the scheduled
processes and compute the average waiting time. Suppose the processes arrive in the order P2,
P3, P4, P1, P5.
Process
Burst Time
P1
3
P2
15
P3
10
P4
2
P5
9
P2
P3
P4
P1
P5
0
15
25
27
30
39
