Least Frequently Used (LFU) Page Replacement Algo

[@swordofll9599]

Not going to lie, this whole video made the LFU understandable to a T. Thanks so much.

[@hamlinhamlinmcgill630]

so far best explanation of lfu i found here. many thanks!

[@pabloamaelwiwi]

After having his reputation ruined in the field of law, Howard decides to get into computer engineering. Truly one of the Howard moments of all time.

[@oldcoolbroqiuqiu6593]

I love your voice! This is the best solution for LFU I've ever seen. Thank you!

[@TechAcademy8]

Thank you :-)

[@SakshiSharma-zy4ie]

So clearly explain the concept that there is no need to see video repeatatively. Thanks 👍🏻😊

[@Aaftab.19]

Fake

[@var-i1s]

In the Least Frequently Used (LFU) page replacement algorithm, if two or more pages have the same frequency (i.e., they've been used the same number of times), then you can apply the Least Recently Used (LRU) algorithm among those pages to decide which one to replace.

[@RajbanshiOmprakash]

fifo

[@gunatejatompala1139]

Thank you mam for your nice explanation. I watched more videos no one can explain in this format 😇

[@AFLIXATV]

*THERE IS AN ERROR IN YOUR DEMONSTRATION* Towards the end, you had two page hits *3* 0 2 and 3 0 *2* when you loaded 3 and 2 respectively. Since the frequency of 3 and 2 are equal, you should have used LRU to break the tie. *3* should have been replaced when you loaded *1* . Therefore the final page presentation should be *1 0 2* . Thank you for your efforts.

[@jayantakumarroy543]

we were using fifo in case frequency where same, from the start.but i have same doubts as yours,as similar question from google have same answer as you said.

[@merlinthomas4553]

Yes I agree

[@studentcommenter5858]

What ever she has done is 100% correct as per her assumptions. She has been using FIFO right from the beginning in case there is a tie in frequency. You can have your own implementations. But according to her problem statement and algorithm the solution is correct.

[@abanoubhany3413]

I was searching for a comment like this, I agree with you

[@vighneshchavan9226]

Nah, she used FIFO for tie breaker instead of LRU it's correct according to her algo

[@sandeepsingh-ns3gr]

very good explanation, content was clear and very helpful.

[@mehmoodali8431]

thanks for your best explanation

[@rizwankhan2534]

best explanation of LFU thank you so much

[@deepkalariya7769]

Nice explanation ❤

[@sapramtejaravind6239]

At 6:55 we have replace the 3 na??why 2 is replaced?

[@uppalaadarshkumar6936]

When you recet a page decrease by one why u r assumed to 0 ?

[@TechAcademy8]

#LFU #Pagereplacement #algo #algorithm #os #operatingsystems #leastfrequentlyused #notfrequentlyused

[@SM7620]

THANK YOU, GREAT EXPLANATIONS

[@uppalaadarshkumar6936]

At 7.03 sec 2's frequency is 2 and u reset by zero , my question is why u reset as zero ( there is chance for 1 also) or any rule is there to reset as zero . Answer me quickly .Please

[@ThulasiMannem]

When frequencies are same then we have to use fifo principle

[@imveryhungry112]

Thank you for this explanation.

[@littlebabymonster97]

brilliant explanation

[@anubutikhazanchi5710]

Nicely explained!!👌

[@rachitchitnis6367]

thanks your teaching is best

[@lahirujeewantha3870]

Thank you so much 💝

[@XYZ9630]

Nice explaination

[@ashwinkarki8112]

ur voice is so sweet luv u so much :*

[@sowparnikam8812]

thank you so much for explaining the concept so clearly..... thanks again.

[@김소빈-o4r]

in this way, can Belady's anomaly be created?

[@studentcommenter5858]

Belady's anomaly may exist in this. Because I can't think of stack implementation for this algorithm. LRU and Optimal are the only algorithms I know as of now which are not effected by belady's anomaly because they are stack algorithms. If you got any inputs do comment. I would like to know.

[@김소빈-o4r]

@@studentcommenter5858 I couldnt find the input not yet...

[@aishwaryamuthukumar2235]

Can u tell abt most frequently used

[@rptechnology2935]

that is concept are very easy i confusion thise method is clear thank you so much .....

[@hello_world_0]

What was the meaning of the crosses afterall ?

[@οκμπος]

The next time you'll need to use FIFO instead of the frequency, you do not take the ones with the cross into consideration.

[@rishavmishra7955]

the result should have been 102 instead of 301....3 should have been replaced instead of 2 in the 3rd last step

[@Toodaloo]

+Rishav Mishra Yep I got the same result.

[@SianGoldofsky]

+Rishav Mishra assuming you are referring to the changes made in the 2nd to last column: From what I understand, you may be confusing LFU with LRFU. With LFU, once the least frequently used value is not unique (i.e. 2 & 3 = 2) the algorithm chooses what to remove based off FIFO - First in First Out of those values. So in our case "2" entered our cache prior to "3" and therefore was removed. This happened despite "2" being called from the cache (NOT removed or added) more recently compared to "3"

[@dewdropk-dl5tv]

+Rishav Mishra , you are using least recently used item( ie how the questions is asked in leetcode) to break the tie (thats why its 102) where as in the video she is using first in first out to break the tie.so its 301 for her

[@Itmasters822]

Very very very good.

[@creativeworks98]

Thank you so much.

[@CodedXtreme]

Thank you.

[@moinqureshi4989]

Will u please explain Optimal page replacement kindly ?

[@Xavierrex3]

Very helpful ty

[@mucahitkatrc3285]

Thank you very much for your illustrating video :)

[@diwang4572]

Thank you!

[@manjubindass7769]

very nice video

[@MegaMido777]

Thx that was helpful

[@박주형-f4e]

why you has used fifo? don't use LRU?

[@VIKRAMSINGH-qu4qq]

✌thanks for the video

[@RohitSharma-jo5vr]

this is more like mfu it should select a page which has not been used frequently in past

[@mythilisaran3961]

Rohit Sharma that is lru

[@jameskurakula8560]

your voice is so sweet mam...

[@firstbay4024]

the video is wrong. the counter does not reset to 0 after being replaced.

[@studentcommenter5858]

Even I felt the same. Is there any proper example available in the Internet?

[@tarunithamraju4094]

Great presentation

[@moinqureshi4989]

Will u please explain Optimal page replacement kindly

[@Tanya-yh1un]

Brilliant!

[@mathscs3789]

Hi, I've got a doubt that I want to clarify, You said whenever any page is removing then make it frequency to reset but actually you one have to decrease it by 1. I mean, there may be cases where if A, B, C are pages present main memory and all are having equal frequencies 5 then as per your concern the frequency of the page to be removed must be kept 0 but it must just be decreased to 4. Thank you.

[@SuperfiveGP]

nice video

[@gigabel1]

Thank you :)

[@mehmoodali8431]

plz make a video about mfu

[@smalltugz]

very nice

[@omkarkadam6854]

tnx good teching....

[@axyd8664]

Thank you

[@ricocoswag]

I trusted you

[@daruk6878]

I believe you

[@codemonkey01]

Hi, Thanks for the well explained video tutorial, I tried it on my end with increase page frames of 4 and with different frequency strings, and it happened that there are two ties. e.g. 2 and 5 both got 1 (count) 3 and 4 also got 2 (count) So in that case which is which? should I apply FIFO on both and check for frequency string that came first? e.g. in my case 2 and 5, 2 came first (2) in 3 and 4, 3 came first (3) BUT, 2 came first before 3, should I replace 2 since it came before 3? Hope to hear you soon, thanks again

[@SalisburyJoshuaer-b1m]

Marian Alley

[@bipinkhatiwada]

you made a mistake at 5:43 ! look, 0 came before 4. so, 0 should have been removed instead of 4 !

[@TechAcademy8]

Bipin Khatiwada This is least frequently used algorithm. So you remove the least frequently used page. 0 has the highest frequency and 4 and 2's frequency was same. So we check which one came first and we remove that one.

[@broosakaa1151]

Mam ap nazar q nai a rhi apki awaz to bht piyari ha mgr ap kahan hooo ?

[@sumanthkumar7921]

Answer in 102

[@rayanenasri]

Thank's

[@mokrathamza532]

thanks

[@kevinmao8609]

Is this an Indian accent?

[@RanaKshitij]

yes, it is

[@WilliamJerome-f4c]

Emard Isle

[@ankitathakur5989]

tnq mam g

[@yashbehara7525]

thanks!.. good one 😉

[@ChildMonica-b1z]

Schneider Gardens

[@houseofareem7436]

ty mam..

[@LauraRobinson-o7l]

Walsh Pike

[@DenaReeves-i2x]

Bernardo Village

[@BillyMildred-k2x]

Crystel Valley

[@BellamyDoris-x4d]

Johnson Camp

[@sudhapinky6275]

👌👌👌👌👌👌

[@farooqshahzad6263]

Wtf if this is LFU then then what is LRU😂

[@이윤선-j9b]

설명좋구연

[@fatayyfatii6]

I got FAILED after watching her video

[@vishnuvishnu4306]

Wrong plz check

[@manyamnandeeshreddy6153]

nice voice

[@adityawadekar6273]

good explanantion! (Y)

[@akramnazri1306]

mende kau aku x pham.

[@이름이없어-d3g]

누나 나 죽어❤

[@crixketeditz8279]

ghalat ha ye pora

[@AshleySingh-m8g]

Gaylord Point

[@Пургер]

that accent is terrible.. my ears are bleeding

[@noddyboffin2988]

Did you really think this comment would accomplish anything? I don't care if this was 5 months ago, you can fuck right off for making fun of someone's accent.

[@apoorva3635]

Andrija Durutovic i find it awesome.

[@vishalmahendran6373]

I'm sure your accent is wonderful. :)

[@cannoli1363]

At least it's understandable comparing to others making CS videos and has subtitles too.

[@FrederickArlen]

57758 Auer Throughway

[@FrankCurme]

3459 Eugene Tunnel

[@SalinaDillenbeck]

444 Crawford Meadow

[@ShawJo-g2n]

8886 Alejandra Corner

[@Lakshmankablog]

Thanks

[@khalidshiba970]

thank you

[@sabafatima1483]

Thank you

[@Tecwithjawad_bahi]

Thanks