As the name suggests, this algorithm works on the principle of “Last in First out“. It replaces the newest page that arrived at last in the main memory. It is implemented by keeping track of all the pages in a stack.