Least Recently Used (LRU) Explanation 

I recommend this video to anyone who for the first time, is trying to learn about REPLACEMENT ALGORITHM - FIFO. It's the most simplest video ever here on RU-vid, than any other video that i came across. Thank you #TechAcademy

Madam u saved my semester 💪😁

Great explanation, the highlighting of the numbers and examining page faults were super helpful.

The Best Explanation.Really helpful, thanks a lot.

i saw a lot of videos and yours are the best one, amazing explanation!

SO CLEAR EXPLANATION THANKYOU

the best best best best best best best best best best best best explaination

Awesome explanation.This helped me in my semester 6 Computer Organization.Thank you very much

thanks for the clarification on page faults. There are some "educational videos" made just for the sake of making money which actually misguide us . They don't consider the first 3 page faults as page faults , rather they count page fault only when a page is replaced.

most conceptual ...and here in this video the red arrow clear all the confusion about LRU. thank you.

Thank you so very much. You are far more clearer than my instructor.

Then what is the difference between FIFO and LRU. It looks similar to FIFO

i can understand clearly .way you teaching is good than my teacher. thank u

Really helpful. Amazing explanation. Last minute life saver. Thank you very much.

tnx i like this tutorial . u make me understand perfectly in LRU page replacement algorithm .

Loved it ! Brilliant explanation . You made me understand perfectly :)

perfect.....clear And simple

Best explanation i've find in RU-vid. Thank you so much

i read text book.i didnot get the logic .but i see this video it is very helpful to me to learn the concept of LRU.thanku so much

Thanks for providing us with a clear understanding, my brain was almost about to explode.

Explained with such simplicity. Great job

Hi , I got the answer for the previous doubt of LRU Algorithm. your page link of FIFO page replacement helped me. Thanks a lot.

Best LRU video I've found. Thanks so much!

Last minute life saver, thank you so much

it was great.understood 3 concepts in just one small video

YES, I LOVE UR EXPLANATION, I LOVE IT SO MUCHH!!!!! THANKK YOUUU

Real clear and simple explanation ... thnq for the video

Thanks mam ❤ now I am fully understand this page replacement algo .

LOVED IT.. U EXPLAINED IN BEST WAY

I have my co paper tomorrow and I cleared my concept seeing ur videos Thanks

Really helpful video..... Thanks a lot mam

This was amazing. Thank you so much! :)

Nicely explained. I understand the actual concept of LRU after watching your video. :)

It clears my confusion 💯💯 best one

The reverse Arrow Mark is helpful to understand thank you very much

Bestest explanation ❤

most appreciate your explanation...thank u so much

crisp and clear thank you

Best Described......... Thanks a ton , man

Thank you for the video. Very clear understanding!

very nice explanation,very useful

On column 6, you said 0 is the mostly used than 1,and 2. but you removed 1？why not 0?

clearest explanation out there! good work! thanks btw~

Explained very well.

Best Explanation. Thanks !

On column 10 is wrong. We need to change 4. 4 is used once, 2 is used twice and 0 is used 3 times => we change 4 with 3.

that was very descriptive and well spoken...thanks

ur explanation was clear...thanksssssssssssss

Excellent explanation

if only the number of pages are given and we are supposed to calculate the number of page faults ..how we do this??

what is the difference between LRU algorithm and optimal replacement algorithm??

crystal clear. Thanks a lots

very easy explanation !ty.

Great thanks man!!! Totaly clear

Hello. The explanation is very good. My doubt is - after checking the most recently used, how to follow the order ? how to place pages in the page frame ? In 4th column - you wrote 2 first and then 0 , then 1. Here as per most recently used , 1 should be written first and then 0. In 6th column - you wrote the pages 2 , 0 first and then 3 . Can i write 3 first and later the most recently used pages? Thanks in advance. Waiting for your reply.

Clear explanation. Thanks a lot!

awesome explanation thank you so much

great explanation thanks fr

Very well explained! Thank you!

Thank you for sharing such a brillant video :) helped me alot

thanku.well explained

Thank you, well explained

Beautiful explanation ❤️

thank you maam .... It helped me a lot ...Thank u soo much♥️

wonderful explanation

Thank you so much for this video! :)

Nice explanation buddy thanks..

You are the best. Thanks a lot!!!!

Thank you, your explanation was clear and helpfull

thank u so much...nyc ecplaination..i understood it very well ..so easy:)

Thank you mam for this explanantionn. You are such a sweetheart!!

Awesome explanation

nice explanation

Hey lru implementation by 2 types, one stack and other count but u only use one ready-made false technic???

Thank You,Its very useful

Thanks .It was very helpful.

very useful thanksalot :)

Much appreciated for this.

Very good job mate

most helpful ma'm thanx for that

Best explanation, otherwise look at other tutes by others, total goes over the head!

Thanxx a lot for well explained

Bauht vadia explanation

Best Explanation.....

Thank you so much 👍

clear explanation thanks

Thanks a lot. This helped a lot :)

Fantastic ! Thank you :)

great video. thank you

Thank you mother

So helpful thanks a lot

Very helpful.. I appreciate.

This is a 3-way associative array. With 2-way associative way and combinations like A B C A B C A, we have hit rate 0 %.

Very useful Thankyou

Why we don't replace 0 in behalf of 3?

omg very helpful. thx u so much

its soo good!! Thank you

Hi tech académie How used the mfu ?? I would like the answers please

Thanks a lot ! It helps me for my OS course ;) !

I think that you made a mistake. You shouldnt switch the 2 on 9th with 3 but with 0 because 0 had no chance and was the oldest until then. Just let me know if I'm wrong.