0
6.1kviews
Consider the processes P1, P2, P3, P4 given in the below table, arrives for execution in the same order, with Arrival Time 0, and given Burst Time.

Draw the Gantt chart and find the average waiting time using the FCFS and SJF (Non-Pre-emptive) scheduling algorithm.

Process Burst Time
P0 21
P1 3
P2 6
P3 2

Subject: Operating System

Topic : Process And Process Scheduling

Difficulty: Hard

1 Answer
0
89views

Answer:

Please log in to add an answer.