C/C++ implementation of some algorithms used in Operating Systems. This repository covers algorithms that were taught in the Operating Systems course (UE18CS303) at PES University, Bengaluru.
The output is a table with rows in the order in which the processes in the queue will be submitted to the CPU.
-
Shortest Job First scheduling: The job with the shortest burst time is sent in first
-
Round Robin Scheduling: All jobs get an equal slice (quantum) of CPU time, and this repeats until all jobs are complete.
-
Priority Scheduling: Jobs are submitted to the CPU in order of their user-defined priorities.
Deadlock detection algorithm is implemented as presented in the textbook Operating Systems Concepts (9e.) by Galvin, Silberschatz and Gagne.