1. FCFS
2. SRTF
3. Round Robin (q=2)
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.
-
Notifications
You must be signed in to change notification settings - Fork 0
RiosNicholas/gantt-chart
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Generates randomized gantt charts for three scheduling algorithms
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published