Algorithms for page replacement play important roles in virtual memory management, especially in paging operating systems. Page substitution happens when the required page is not retained in the memory (file fault) or the free accessible file is not adequate to fulfill the requirement. It is either there are none or the amount of free sites is fewer than the required total. Two regular page replacements were hybridized as Hybrid Page replacements (HRA) in this analysis (LRU and OptimalOPT algorithms recently used). For its service, HRA is based on the principle of OPT and LRU. The HRA was determined by comparing the page failures caused with the default algorithms First InFirst Out FIFO, LRU and Optimal. Tests showed the amount of frames through to 4 and beyond the HRA outperformed FIFO, OPT and LRU.