Skip to content

Latest commit

 

History

History
10 lines (9 loc) · 311 Bytes

README.md

File metadata and controls

10 lines (9 loc) · 311 Bytes

gantt_chart

Algorithms:

1. FCFS
2. SRTF
3. Round Robin (q=2)

Requirements:

1. Generate 10 processes with arrival times between 0 and 11 ms.
2. Implement FCFS, SRTF, and Round Robin scheduling algorithms.
3. Calculate the average wait time and turnaround time for each algorithm.