CPU Scheduling Algorithms

This project implements various CPU scheduling algorithms, allowing users to choose between different strategies for managing process execution.

Implemented Algorithms

• First In First Out (FIFO)
• Shortest Job First (SJF)
• Priority Scheduling (ALG P)
• Shortest Remaining Time First (SR_F)
• Round Robin (RR)

Requirements

To run this project, make sure you have Python 3 installed.

Installation and Execution

1. Clone this repository:

   git clone https://github.com/your_username/your_repository.git

2. Navigate to the project directory:

   cd your_repository

3. Run the main script:

   python main.py

Usage

The program will display a menu in the terminal where you can select the scheduling algorithm to execute. For each option, process data will be requested, such as burst time, arrival time, and in some cases, priority.

Input Data

For each process, you must enter:

• Burst Time: Process execution time.
• Arrival Time: The moment the process arrives in the system.
• Priority: Only applicable for priority scheduling.

For Round Robin, the time quantum will also be requested.

Expected Output

The program will execute the selected algorithm and display the scheduling results in the terminal.

Project Structure

📂 your_repository
│-- FIFO.py
│-- SJF.py
│-- ALG_P.py
│-- SR_F.py
│-- RR.py
│-- main.py
│-- README.md

• FIFO.py, SJF.py, ALG_P.py, SR_F.py, RR.py: Contain the algorithm implementations.
• main.py: Contains the menu and main program logic.
• README.md: Project documentation.