Memory management - Page replacement
Consider this case:
I have a process that uses 4 pages, and there are 3 available frames in the memory.
I need to find a sequence in which number of page faults when using LRU is smaller than the number of page faults when using Second Chance FIFO algorithm.

Can I get help with that, please?

Thanks in advance
Memory management - Page replacement
===

Consider this case:
I have a process that uses 4 pages, and there are 3 available frames in the memory.
I need to find a sequence in which number of page faults when using LRU is smaller than the number of page faults when using Second Chance FIFO algorithm.

Can I get help with that, please?

Thanks in advance