Optimal page replacement algorithm is the best page
replacement algorithm that has minimum no. of page fault
as compared to any otherpage replacement algorithm.It
is from belady's anomaly" but is very difficult to implement.
A optimal paging algorithm is described when the program behavior
is represented by the LRU (least recently used) stack model.