Processes & Scheduling Workbook

CS 310 Teaching Team · practice set

Section 1

Scheduling timelines

Given five processes with arrival and burst times, draw Gantt charts for FCFS, SJF and Round Robin with a quantum of 4.

Compute the average waiting and turnaround time for each policy.

Which policy would you choose for an interactive system, and why?

Fictional educational sample written for the Athena demo · Page 9 of 58.

50%saved