A university project built in C simulating Operating System process scheduling algorithms (ordenancement des processus).
This project was developed during my computer science studies at ISI as part of the Operating Systems course.
It simulates how an OS manages processes in the CPU. The core algorithms implemented include:
The program takes a set of processes with their arrival times, burst times, and priorities, and then calculates waiting times, turnaround times, and generates a Gantt chart representation in the console.
Note: There is no live demo available for this project as it is a CLI-based C program meant to run in a local terminal.