PageHunt is an interactive visualizer that demonstrates how different page replacement algorithms manage memory.
It helps you understand the working of FIFO, LRU, and Optimal algorithms with step-by-step visualizations and page fault tracking.
- π Supports FIFO, LRU, and Optimal page replacement algorithms
- π― Tracks the number of page faults for each algorithm
- π‘ Interactive interface for entering:
- Page reference string
- Frame size
- π Visual representation of memory frames and page hits/faults
Make sure you have a browser and basic web setup (HTML/CSS/JS) ready.
- Clone the repository:
git clone https://github.com/YazhiniGowrisankar/Page-Hunt-Algorithm-Visualizer.git