Question: Qu/ An operating system uses SJF Scheduling algorithim for preemptive scheduling of processes. Consider the following set of processes with their arrival times and cpu

Qu/ An operating system uses SJF Scheduling algorithim for preemptive scheduling of processes. Consider the following set of processes with their arrival times and cpu burst time (in Milli Second) Priority. Draw the Gantt Chart and Calculate the average waiting timelin millisecond) arrival time Process PO irst time Priority .7 - 1 2 2 Pi P2 PS P4 ---6- 4 -7 2 3 --4 1 - - - 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
