0
3.5kviews
Consider the following set of processes, assuming all are arriving at time 0.
| written 6.8 years ago by | • modified 4.2 years ago |
| Process | Burst Time | Priority |
|---|---|---|
| P1 | 2 | 2 |
| P2 | 1 | 1 |
| P3 | 8 | 4 |
| P4 | 4 | 5 |
| P5 | 5 | 3 |
Calculate average waiting time and turn-around time for FCFS, SJF (Non-Pre-emptive), Priority and RR (Quantum=2).
Subject: Operating System
Topic: Process Concept and Scheduling
Difficulty: High
ADD COMMENT
EDIT
1 Answer

and 3 others joined a min ago.