OS Simulator & Algorithm Visualizer
Welcome to OSXplore, an interactive Operating System Simulator built with HTML, CSS, and JavaScript.
This project is designed to teach and demonstrate key OS algorithms through beautiful animations and intuitive interfaces — perfect for students, educators, and curious developers!
- Interactive Visualizations of classic OS algorithms
- Step-by-step Tutorials for each algorithm
- Smooth Animations for better understanding
- Reset & Replay features for practice and review
- Designed to be educational, beginner-friendly, and fun!
Check out the project live here:
🔗 Live Demo
git clone https://github.com/SRIRAM231005/OSXplore.git
open index.html # or use Live Server extension in VS Code- FCFS
- SJF (Preemptive & Non-preemptive)
- Round Robin
- Priority Scheduling
- FCFS
- SCAN, C-SCAN
- LOOK, C-LOOK
- SSTF
- MFT (Fixed Partitioning)
- MVT (Variable Partitioning)
- First Fit
- Next Fit
- Worst Fit
- Best Fit
- Simulation of Paging (Virtual Memory)
- FIFO
- LRU (Least Recently Used)
- LFU (Least Frequently Used)
- MFU (Most Frequently Used)
- Optimal
- Second Chance
- Enhanced Second Chance
- Additional Bit Algorithm
- Equal Allocation
- Proportional Allocation
- Priority Allocation
- Contiguous Allocation
- Linked Allocation
- Indexed Allocation
- Deadlock Prevention
- Deadlock Avoidance (Banker’s Algorithm)
- Deadlock Detection
- Producer-Consumer Problem
- Reader-Writer Problem
- Dining Philosophers Problem
- Sleeping Barber Problem
- Inter-process vs Intra-process Communication
fork()exec()wait()exit()- Overview of system call mechanism
- EDF (Earliest Deadline First Scheduling)
- RMS (Rate Monotonic Scheduling)
- HTML
- CSS
- JavaScript