X


Scheduling Algorithms - First-Come, First-Served Scheduling




Q. Consider the process and their burst times as given in the table


ProcessBurst time
P124
P23
P33





Shortest-Job-First Scheduling (shortest-next-CPU-burst algorithm)




Q. Consider the process and their burst times as given in the table


ProcessArrival timeBurst time
P108
P214
P329
P435





Priority Scheduling






Q. Using priority scheduling, we would schedule these processes according to the following Gantt chart:


ProcessArrival timeBurst time
P1103
P211
P324
P415
P552



Round-Robin Scheduling






Q. Apply RR scheduling on the below processes (quantum = 4ms)


ProcessArrival timeBurst time
P124
P23
P33

Previous Next