Operating Systems Algorithms Project

This project implements fundamental Operating System algorithms using Python and Jupyter Notebook.

Implemented Algorithms

CPU Scheduling

• Round Robin Scheduling

Memory Allocation

• Best Fit Memory Allocation

Page Replacement

• Least Recently Used (LRU)

---

Features

• Dynamic user input (no hardcoded values)
• Step-by-step execution
• Gantt Chart generation
• Performance calculations
• Fragmentation analysis
• Page fault tracking
• Graphical visualization using Matplotlib
• Algorithm comparison and analysis

---

Technologies Used

• Python 3
• Jupyter Notebook
• Matplotlib
• Tabulate

---

Project Structure

OS_Project/
│
├── Operating_System_Project.ipynb
├── README.md
└── requirements.txt

---

Installation

Install required libraries:

pip install matplotlib tabulate

---

Running the Project

Open the notebook:

jupyter notebook

Then run all notebook cells sequentially.

---

Outputs

The project provides:

• Scheduling tables
• Waiting & Turnaround Times
• Memory allocation tables
• Frame status tracking
• Total page faults
• Performance graphs

---

Comparison & Analysis

The implemented algorithms are compared with alternative approaches to analyze:

• Performance
• Efficiency
• Advantages
• Disadvantages
• Use cases

---

Conclusion

This project demonstrates practical implementation of Operating System concepts and provides performance analysis of different algorithms through interactive execution and visualization.