1.First In First out(FIFO)
In ths algorithm,the operating system keeps track of all pages in the memory in a queue,the oldest pageis in the front of the queue. When a pageneeds to be replaced page in the front of the queue is selected for removal.
2. Optimal Page replacement
In this algorithm, pages are replaced which would not be used for the longest duration of time in the future.
3. Least Recently Used (LRU)
ln this algorithm page will be replaced which is least recently used.