Problem
1. Name and describe three CPU scheduling algorithms.
2. Draw a Gantt chart that shows the completion times for each process using first-come, first-served CPU scheduling.
3. Draw a Gantt chart that shows the completion times for each process using shortest-job-next CPU scheduling.
4. Draw a Gantt chart that shows the completion times for each process using round-robin CPU scheduling with a time slice of 60.
|
Process
|
P1
|
P2
|
P3
|
P4
|
P5
|
|
Service time
|
120
|
60
|
180
|
50
|
300
|