Your explanation is good ma'am, this example is sufficient for exams, but if someone really wants to know how LRU works then this is the gist: 1. Memory Management Unit has page table. 2. All the pages in the page table form a linked list 3. LRU algorithm requires an extremely fast hardware (obviously expensive), to segregate the pages into most recently used and least recently used pages. This segregation is done in every clock tick or page fault, thus the need for the hardware to be extremely fast. The software implementation of this is known as NFU (Not Frequently Used) which uses an aging algorithm to determine least frequently used page. 4. LRU is said to be extremely efficient but it is also equally difficult to implement, that's why people came up with work arounds.
Today i'll take seminar abt lru... By saw ur vedio. It was so easy to understand.. Ur mam applause&appreciate me.I am so happy bcoz of u mam.. All credits goes to u.... Tq mam❤❤❤❤❤❤❤❤
She's explaining us it's a great thing presentation don't matter if the students are able to understand. as we all know we are very very familiar with her explanation and Don't try to change that familiarity . Hope you don't mind 😁😀 .And we always support Bhanu madam
Bro actually the last three digits in some case was not least recently so we can then check with more then 3 digits and find out the least recently so she checked 4 digits
Best way to memorize how many digits you look back is by the N frames and UNIQUE values. So, if you have 3 frames, like in the example, you reference the third least recently used unique value to the left. If it's 4 frames, then it's 4th unique value.
She's explaining us it's a great thing presentation don't matter if the students are able to understand. as we all know we are very very familiar with her explanation and Don't try to change that familiarity . Hope you don't mind 😁😀 .And we always support Bhanu madam
Thank you mam :: Today July 13 at 10am I'm having OS semester examination I'm learning page replacement clearly from you than my Os mam.. Thanx for it❤❤
I always watch these videos in 1.75x speed.Very helpful.Thanks
why so fast
@@denissssss8579 Even 1.75 seems slow to me..
It means that u are using for revision
It's working
Thanks for your suggestion❤️😁🙏
Finally I understood this topic by your video. Thank you mam.
The only online resource that could finally explain it in detail! Thank you so much!
It's really helpful for us even after 5 year's
Your explanation is good ma'am, this example is sufficient for exams, but if someone really wants to know how LRU works then this is the gist:
1. Memory Management Unit has page table.
2. All the pages in the page table form a linked list
3. LRU algorithm requires an extremely fast hardware (obviously expensive), to segregate the pages into most recently used and least recently used pages. This segregation is done in every clock tick or page fault, thus the need for the hardware to be extremely fast. The software implementation of this is known as NFU (Not Frequently Used) which uses an aging algorithm to determine least frequently used page.
4. LRU is said to be extremely efficient but it is also equally difficult to implement, that's why people came up with work arounds.
What is difference btn LRU and FIFO?
i have a test in some few hours, and this was very helpful. thanks.
Today i'll take seminar abt lru... By saw ur vedio. It was so easy to understand.. Ur mam applause&appreciate me.I am so happy bcoz of u mam.. All credits goes to u.... Tq mam❤❤❤❤❤❤❤❤
She's explaining us it's a great thing presentation don't matter if the students are able to understand. as we all know we are very very familiar with her explanation and Don't try to change that familiarity . Hope you don't mind 😁😀 .And we always support Bhanu madam
best explaination ever on internet wow
Best greetings from Germany. We love your videos!
Thank you very much, the video was quite helpful.
Thumbs up. Love from Bangladesh.
Well done maam! Please teach us how to compute for the failure and success ratios. Thanks❤️😊
Very helpful, thanks for all the great videos
Thank you for helping a lot mam , it is midnight and morning i have my sem exam , i understood the concept clearly .
Thank you so much mam 🙏this video is very easy to understand and useful thanks for uploading.. make more subject related viedo
thanks alot, brilliantly explained.
Very well explained! Thankyou ❤️
Thanks for such a good explanation 🙏🔥♥️
Good class....I almost studied your class ...thank u very much ...teacher
Thank you for very good explanation and good english
Thank you very much. This was very helpful
Thank u so much mam......it is very helpful and simply understand that...........🤗🤗
Thank you! you've saved my life!!
Great job. Aced this immediately.
Your explanation was very clear mam.. Thanks
Thaaanks our teacher couldn't explain the logic quite well 10 min here everything was understood
Many thanks 🥰....This helps a lot.
Simplest and the best explanation
at 5:24 why we checked with 4 digits to replace? in rest of the algorithm we always check from the last 3 digits before removing...???
Bro actually the last three digits in some case was not least recently so we can then check with more then 3 digits and find out the least recently so she checked 4 digits
Thq ma'm....gud explanation
Thank you mam.. it's so much helpful for me and I'm your new subscriber ❤🎉
Best way to memorize how many digits you look back is by the N frames and UNIQUE values. So, if you have 3 frames, like in the example, you reference the third least recently used unique value to the left. If it's 4 frames, then it's 4th unique value.
Thanks bro 👍
Hats off Bro🙏
🫡👍
Thnku bro🫡❤
Very nice tutorial. Very easy to understand it. Thank you!
S
Very nice mam.....your videos are the best
thanks madam, let you be my instructor through out my collage study
Now I understood completely
Chalaa bagaa ardham ayendhi thanks mam
Thank you mam
You are explaining very good mam
thank you mrs for helping my study
thank you professor! this made me understand this algorithm
Tq mam very good explanation😊😊
coloring is good, makes a nice presentation. good job & thank you
She's explaining us it's a great thing presentation don't matter if the students are able to understand. as we all know we are very very familiar with her explanation and Don't try to change that familiarity . Hope you don't mind 😁😀 .And we always support Bhanu madam
Actually it's matter. There is a word first impression. If you know i won't need to explain any farther. If not reply me
@@smmahadi9448 your right
@@smmahadi9448 but explanation is important
Tqsm 🥰 i learnt alot frm the video
Thank you mam ::
Today July 13 at 10am I'm having OS semester examination
I'm learning page replacement clearly from you than my Os mam..
Thanx for it❤❤
Thank you couldn't get this all understood now
If any reference string is most recently used could we put in top of the RAM?
very helpful. thank you so much maam
Very nice Explanation
Thank you 🎉
Thank you from iraq 👍❤️
Only 30 min to final exam😢
This playlist will save me
Tq madam for clean explanation
it helped alot thanks
Thanks a lot Mam.
Most Useful ❤️🥺
Thankuuuuu Mam 4 help
thankyou priya maam
Thank you! You help me alot :>!!!
mam in case of 5 frames should we check 5 numbers before to get least recently used?
10Q mam i really understand more than the teacher teach me in the class
Thankyou so so much 💯
It help,thanks alot
Thank you so much mam
tomorrow I have exam this helped me alot......💜💜💜🤚🤚🤚
Have you pass your xam
Thanks a lot
Thanks for this video madam
is it the countable algorithm in LRU?
Awesome 💙🌸
BRAVO 💪👏
Qué linda 😊
Thank you👏🏾👏🏾
Thank you mam❤️
TYSM❤
Thank u so much
omg thank you sooo muchhhh
Thank you 🙂
Thanks alot !!
Thank u so much mam
Thanks a lot mam ☺️
thnkyou mam 😍
So helpful video
Just implementing LRU algorithm using stacks DS will solve the problem soon
Achcha lga medam ji vedio bahut achcha
Thank you ma'am ♥️
thankxx mam
Thank you.
But what is difference between FIFO and LRU
FIFO M V JO PHLE use hua tha usi ko remove kr rhe the aur isme v whi remove kr rhe hai
Tq so much
Thank you ;)
Thanks a ton
Thankyou maam
Thank you ❤
Thankyou ma'am ❤
Thank you!
good work very clear
very Good Explain
thank you so much
how to know that value in main memory or not ?
Hi mam after the 3 palced hit is occupied then u take least vali is 2 why not 0
Same doubt
Thank you Maam
Clean and clear
great video!!!!!!