Search your topic here

FCFS SJF and Round Robin

Prob. Consider the following jobs-

Job
Burst Time
1
10
2
29
3
3
4
7
5
12


Consider the FCFS, SJF and RR (quantum=10) scheduling algorithm for this set of processes. Which algorithm would give the minimum average waiting time?

Ans.



LEAVE A REPLY