Page replacement algorithms are important of virtual memory management and it helps the operating system to decide which memory page can be moved out making space for the currently needed page. Whenever a process refers to a page that is not present in memory, a page fault occurs. Each algorithm has the objective to minimize the number of page faults. With minimum page faults, the performance of the process is increased. The purpose of this paper is to analyze the three algorithms via. First in First out(FIFO), Least Recently Used(LRU) and Optimal Page Replacement(OPT) is implemented using C++ programming. We will present implementation of three algorithms and compare their performance on generated virtual traces.