This repository contains a C implementation of various common algorithms used in Operating System design, taught as part of an Operating Systems course at the undergraduate level.
The following is a list of algorithms available in this repository:
- Disk Scheduling Algorithms
- First-Come First-Served (FCFS)
- Shortest Seek-Time First (SSTF)
- SCAN / Elevator
- Circular SCAN (C-SCAN)
- LOOK
- Circular LOOK (C-LOOK)
- Memory Allocation
- First Fit
- Best Fit
- Worst Fit
- Page Replacement
- First-In First-Out (FIFO)
- Optimal (OPT)
- Least Recently Used (LRU)
- CPU / Process Scheduling
- First-Come First-Served (FCFS)
- Shortest Job First (SJF)
- Shortest Remaining Time First (SRTF) / Pre-emptive SJF
- Priority (Pre-emptive)
- Priority (Non pre-emptive)
- Round-Robin
You are most welcome to contribute more algorithms! Please read our Contribution Guidelines first to get started.