Last-In-First-Out:

As the name suggests this algorithm follows "Last-In-First-Out" principle

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.

Advantages:

• Simple and easy to understand and implement


• Low overhead

Disadvantages:

• Poor Performance


• Doesn't consider the frequency of use or last used time, simply replaces the oldest page.