made easy cbt 1

Question

 

HOW TO SOLVE ?PLEASE PROVIDE THE COMPLETE SOLUTION.

Comments

In case of FIFO , Page 3 was the first one to be loaded. So it must go.

In case of LRU , Page 2 is the least recently used page.

---

this one also given in the made easy solution . i want the complete solution,if yu may ,please!

---

See in case of FIFO , it works like a queue . The first one to enter , is the first one to go.

From the table we can see that , Page 3 is the 1st one to be loaded into the memory ,  right?

Thus when page replacement occurs it will be the first one to go.

Now in the case of LRU , or popularly Least Recently Used Page Must go.

Again from the table we can clearly see that , Page 2 was last referenced at t=306.

And every other page has been referenced after that . Thus Page 2 become the oldest referenced page . Thus when replacement would occur , this page must be replaced.