Explain the page replacement policies. Implement LRU, OPT, FIFO for a sequence. Also calculate hits and faults.

1.7kviews

written 6.4 years ago by

priyad84 • 350

modified 2.2 years ago by

teamques10 ★ 65k

Consider following data

Sequence: 0, 1, 2, 4, 3, 7, 1, 4, 2, 3

Frame size: 3

ADD COMMENT EDIT

1 Answer

60views

written 2.4 years ago by

binitamayekar ★ 6.4k

First In First Out (FIFO) Page Replacement Algorithm

This algorithm works on the principle of “First in First out“.
It replaces the oldest page that has been present in the main memory for the longest time.
It is implemented by keeping track of all the pages in a queue.
The …

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.