Implementation of most commonly used algorithms in modern operating systems
-
Different Processes in Operating Systems
- Parent and Child Process
- Zombie Process
- Orphan Process
-
CPU Scheduling Algorithms
- First Come First Serve (FCFS)
- Shortest Job First (SJF) - Preemptive and Non-Preemptive
- Round Robin Scheduling (RR)
- Priority Scheduling - Preemptive and Non-Preemptive
-
Deadlock Avoidance and Prevention Algorithms
- Bankers Algorithm
- Resource Request Algorithm
-
Interprocess Communication
- Threads
- Pipes
-
Process Synchronization
- Producer-Consumer problem
- Reader-Writer problem
- Dining Philosophers problem
-
Dynamic Memory Allocation Algorithms
- First Fit
- Next Fit
- Best Fit
- Worst Fit
-
Page Replacement Algorithms
- First In First Out (FIFO)
- Least Recently Used (LRU)
- Optimal
-
Disk Scheduling Algorithms
- First Come First Serve (FCFS)
- hortest Seek Time First (SSTF)
- Elevator Algorithm (SCAN)
- Circular SCAN (CSCAN)
- LOOK
- CLOOK