This is rather simple conceptual question. I can guess the answer, but no text explicitly discuss thrashing in the context of different page replacement algorithm. So I want to take your confirmation for my guessings.
The definition of the thrashing is:
In computer science, thrashing occurs when a computer’s virtual memory resources are overused, leading to a constant state of paging and page faults, inhibiting most application-level processing
My guessings about which page replacement algorithms may cause thrashing:
Least Recently Used (LRU) page replacement algorithm: I believe LRU can lead to thrashing. This may happen when pages are accessed in the order 12341234… and number of frames available is 3. In this case every page access results in page fault, leading to page movements and hence causes thrashing.
Most Recently Used (MRU) page replacement algorithm: causes thrashing for reasons similar to LRU.
Least Frequently Used (LFU) page replacement algorithm: causes thrashing for reasons similar to LRU. (I feel LFU can behave like FIFO in certain sequences of page accesses and as FIFO can cause thrashing, LRU can also cause thrashing.)
First In First Out (FIFO) page replacement: causes thrashing for reasons similar to LRU.
Optimal page replacement: I believe this is the only page replacement algorithm which does not cause thrashing.
I am write with these above five guesses?