and 5 others joined a min ago.
1
52kviews
Draw the Gantt Charts for FCFS,SJF,Preemptive priority and RR(Quantum=2)
written 7.3 years ago by
gp4803
• 200
|
modified 3.3 years ago
by
binitamayekar
★ 6.7k
|
Subject: Operating System
Topic: Process Management And Memory Management
Difficulty: Medium
Consider the following set of processes,with length of CPU bursts given in Millisecond as follows:
| Process | Burst Time | Arrival Time | Priority |
|---|---|---|---|
| P1 | 8 | 0 | 3 |
| P2 | 1 | 1 | 1 |
| P3 | 3 | 2 | 2 |
| P4 | 2 | 3 | 3 |
| P5 | 6 | 4 | 4 |
1.Draw the Gantt Charts for FCFS,SJF,Preemptive priority and RR(Quantum=2)
2.What is the turn around time of each process for above algorithm?
3.What is the waiting time of each process for each of the above algorithm?
4.Which algorithm results in minimum average waiting time.
ADD COMMENT
EDIT
1 Answer
and 2 others joined a min ago.