A console-based CPU Scheduling Simulator implemented in C that demonstrates how an Operating System schedules processes using classical scheduling algorithms. The project simulates real CPU behavior and calculates important performance metrics with a Gantt chart visualization.
-
π Implements multiple CPU scheduling algorithms:
- First Come First Serve (FCFS)
- Shortest Job First (Preemptive SJF)
- Round Robin (RR)
-
π Gantt Chart visualization (text-based simulation)
-
β±οΈ Computes key OS metrics:
- Completion Time (CT)
- Turnaround Time (TAT)
- Waiting Time (WT)
- Response Time (RT)
-
π₯ User-defined process input:
- Arrival Time
- Burst Time
-
π Dynamic simulation of CPU execution over time
- Language: C
- Concepts:
- Operating Systems
- CPU Scheduling Algorithms
- Process Management
- Arrays and Simulation Logic
If you find this project useful, please consider starring β the repository. It helps increase visibility and encourages further development and enhancements.
