Processes: (fixed for demo — P1–P5 arriving at different times)
| PID | Arrival | Burst | Priority |
|---|---|---|---|
| P1 | 0 | 5 | 2 |
| P2 | 1 | 3 | 1 |
| P3 | 2 | 1 | 3 |
| P4 | 3 | 2 | 2 |
| P5 | 4 | 4 | 1 |
Pick a scheduling algorithm and step through how an OS schedules CPU time for processes. Try FIFO, Round Robin, or Priority Scheduling.
Processes: (fixed for demo — P1–P5 arriving at different times)
| PID | Arrival | Burst | Priority |
|---|---|---|---|
| P1 | 0 | 5 | 2 |
| P2 | 1 | 3 | 1 |
| P3 | 2 | 1 | 3 |
| P4 | 3 | 2 | 2 |
| P5 | 4 | 4 | 1 |