This paper presents a Python-based simulator designed to evaluate and compare various cache replacement policies, including FIFO, LRU, LFU, and Clock algorithms. The simulator aims to provide an educational tool for students to understand cache behavior through experimentation, bridging the gap between theoretical learning and practical implementation. The tool supports multiple cache organizations such as direct-mapped, set-associative, and fully associative caches. Performance is measured in terms of hit/miss ratio and execution time under varying workloads.