Welcome to the repository for Operating Systems Scheduling Algorithms implemented in Python. This repository contains various scheduling algorithms used in operating systems to manage processes. The aim is to provide clear and efficient implementations of these algorithms for educational purposes.
Scheduling is a critical part of an operating system's functionality, managing the execution of processes by the CPU. This repository provides Python implementations of several key scheduling algorithms, offering a practical resource for students and enthusiasts to understand and experiment with these concepts.
- First-Come, First-Served (FCFS)
- Shortest Job First (SJF)
- Priority Scheduling
- Round Robin (RR)
- Longest Job First (LJF)
To run the code in this repository, you need to have Python installed. You can download Python from here.
Each algorithm is contained in its own Python file. To run an algorithm, simply execute the corresponding Python file.