This repository contains implementations of important Operating System algorithms written in C Programming.
The programs are designed for:
- 🎓 University Laboratory Work
- 📚 Academic Learning
- 📝 Viva Preparation
- 💻 Practical Demonstrations
- 🚀 GitHub Portfolio Enhancement
Each program is implemented with proper logic and produces scheduling statistics such as:
- Completion Time (CT)
- Turnaround Time (TAT)
- Waiting Time (WT)
- Page Fault Analysis
| Algorithm | Type |
|---|---|
| First Come First Serve (FCFS) | Non-Preemptive |
| Shortest Job First (SJF) | Non-Preemptive |
| Shortest Job First (SJF) | Preemptive |
| Priority Scheduling | Non-Preemptive |
| Priority Scheduling | Preemptive |
| Round Robin | Preemptive |
| Algorithm |
|---|
| Least Recently Used (LRU) |
- C Programming
- GCC Compiler
- Turbo C++
- VS Code
- Windows Command Prompt
gcc filename.c -o output
./output- Open Turbo C++
- Create New File
- Paste Source Code
- Compile (Alt + F9)
- Run (Ctrl + F9)
- CPU Scheduling
- Process Management
- Waiting Time Calculation
- Turnaround Time Calculation
- Completion Time Calculation
- Memory Management
- Page Replacement Algorithms
Operating-Systems-Lab-Programs/
│
├── README.md
├── First-Come-First-Serve/
├── Shortest-Job-First-Non-Preemptive/
├── Shortest-Job-First-Preemptive/
├── Priority-Scheduling-Non-Preemptive/
├── Priority-Scheduling-Preemptive/
├── Round-Robin-Scheduling/
└── Least-Recently-Used/
After completing these programs, students will be able to:
✔ Understand Scheduling Algorithms
✔ Compare Scheduling Techniques
✔ Calculate CT, TAT and WT
✔ Understand Memory Management
✔ Analyze Page Replacement Methods
Amit Kumar Maity
B.Sc Student | Computer Science
College: Midnapore College Autonomous
linkdin: Amit Kumar Maity
⭐ If you found this repository useful, please give it a Star.