Interactive learning tool for CPU Scheduling and Page Replacement Algorithms
Quick Start • Features • Showcase • Usage • Tutorials
QuantumQueue is a comprehensive educational tool designed to help students learn and practice CPU Scheduling and Page Replacement Algorithms. With an intuitive interface, step-by-step tutorials, and real-time visualizations, mastering these core operating system concepts has never been easier.
- Practice Mode: Test your understanding with randomized problems
- Solution Checking: Verify your answers against correct solutions
- Visual Feedback: See colorful Gantt charts and queue visualizations
- Calculated Metrics: TAT, WT, responsiveness, hit ratios, and more
| Platform | Download | Instructions |
|---|---|---|
| Windows | 📥 Download EXE | Run QuantumQueue-Setup.exe and follow the installer |
| macOS | 📥 Download DMG | Open DMG, drag to Applications folder |
| Portable | 📥 Download ZIP | Extract and run QuantumQueue.exe directly |
# Clone the repository
git clone https://github.com/dianbrown/CPU-SchedulingApp.git
cd CPU-SchedulingApp
# Install dependencies
pip install -r requirements.txt
# Run the application
python main.py| Algorithm | Type | Description |
|---|---|---|
| FCFS | Non-preemptive | First Come First Served - Basic FIFO scheduling |
| FCFS Priority | Preemptive | Priority-based with FCFS tie-breaking |
| SJF | Non-preemptive | Shortest Job First - Optimal for average wait time |
| SJF Priority | Preemptive | Priority-based with shortest job tie-breaking |
| SRT | Preemptive | Shortest Remaining Time - Preemptive SJF |
| Round Robin | Preemptive | Time-quantum based fair scheduling |
| RR Priority | Preemptive | Priority + time quantum scheduling |
| Algorithm | Description |
|---|---|
| FIFO | First In First Out - Queue-based replacement |
| LRU | Least Recently Used - Recency-based replacement |
| Optimal | Farthest future use - Theoretical best |
| Second Chance | Enhanced FIFO with R-bit second chances |
| Clock | Circular buffer with R-bit sweep |
- 🎨 28 Beautiful Themes — Dracula, Nord, Tokyo Night, Solarized, and more
- 📊 Visual Gantt Charts — Interactive timeline visualization
- 🎯 Step-by-Step Tutorials — Learn every algorithm with examples
- 🔄 Random Problem Generation — Endless practice opportunities
- 📝 Editable Tables — Customize processes and frames
- 📈 Real-time Metrics — WT, TAT, hit ratios, fault counts
- 🎭 Drag-and-Drop — Interactive queue reordering for PRA
- 💾 Persistent Settings — Your preferences saved across sessions
- ♿ Colorblind Accessible — Configurable hit/fault colors
- Select Algorithm — Choose from the dropdown (FCFS, SJF, Round Robin, etc.)
- Generate Problem — Click "Randomize" or enter your own processes
- Fill Timeline — Click cells to schedule processes:
Single Click— Fill one time slotDouble Click— Auto-fill entire burst timeRight-Click— Add RS (Ready State) markers
- Check Solution — Verify your answer against the correct solution
- View Metrics — See WT, TAT, and responsiveness per process
- Select Algorithm — Choose FIFO, LRU, Optimal, Second Chance, or Clock
- Set Up Frames — Configure frame count and initial pages
- Enter Page Sequence — Type pages or use "Randomize"
- Arrange Queue — Drag-and-drop frames to set initial order
- Solve & Check — Mark hits/faults and verify your solution
Access step-by-step tutorials from the Help screen:
- Click the Help icon (❓) in the sidebar
- Choose CPU Scheduling or Page Replacement
- Select any algorithm card
- Click "View Example" for an interactive walkthrough
Each tutorial includes:
- Algorithm rules and edge cases
- Randomizable practice problems
- Step-by-step explanations
- Visual queue/table updates
Additionally, the Algorithm Rules document provides a detailed explanation of each algorithm's logic. Combined with the provided Python classes i created for each algorithm, it offers a comprehensive resource for understanding the implementation and applying it to your own code or programs.
QuantumQueue/
├── main.py # Application entry point
├── requirements.txt # Python dependencies
├── algorithms/ # CPU scheduling algorithms
├── PRA/ # Page replacement algorithms
│ ├── algorithms/ # FIFO, LRU, Optimal, etc.
│ ├── models/ # Frame data models
│ └── ui/ # PRA interface
├── pages/ # UI pages and tutorials
├── themes/ # Theme JSON files
├── tutorial_kb/ # Tutorial step definitions
├── Assets/ # Icons and resources
└── utils/ # Helper utilities
Contributions are welcome! Feel free to:
- Report bugs or issues
- Suggest new features
- Submit pull requests
This project is open source and available for educational purposes.
Made with ❤️ for students learning Operating Systems