Lecture 29: Page Replacement Algorithms || How to implement LRU algorithm?

[@rabbanimunna6992]

Earlier I was very weak in OS concepts, after watching your series I can say with utmost confidence that I am super confident in OS. Thanks for making our lives easy. Loved this series.

[@kunwardeepsingh3353]

best channel for computer science student if you are a fresher and reading this believe me i yhave done DSA from this channel and mazaa aa gya now doing OS and pehli baar OS samajh aa rha hai. If u are from CSE this channel is GOD.

[@shivanshvish4879]

I have binged watch this series successfully with no interruption. It was I can say the most practical and knowledgeable series in OS. This is how our education system should look like

[@rohitantil9534]

This OS series is very amazing ❤️ thank you lakshay bhai❤️❤️

[@climpZ_7k7]

one month of absorbing this playlist easily beats an entire semester of OS , both in comfort and depth , finally done with this playlist. thanks a lot for doing this✌ P.S we desperately need something like this for computer networks now

[@devendrasuthar5530]

Bhaiya your OS series was really amazing as DB I have watched both series and I am from mechanical background. waiting for you next series on computer networks.

[@ayushraj6525]

Lru cache implement kar liya bhaiya. Implemented it using orderedDict in python.. Maza aagya 😃

[@mdsumama9930]

Best Underrated operating system course

[@smanivesh]

Os k baad ab DBMS start krna please🙏

[@VIJAYKUMAR-dj6kf]

honestly, it's an awesome course, followed it so far and would suggest to those checking comments for how the course actually is, thank you bhaiya

[@vibhavtripathi5226]

Awsm. twist when the best technique is not possible! Note: - This comment is with refernce to the Optimal Page Replaccement Algorithm.

[@aarinsheik1583]

34:00 , queue would have been a better solution than stack , any thoughts ?

[@___divykant___]

very grateful to babbar bhaiya , such a nice course , legit attended all the videos of this course which made my confidence so highhh

[@0708Sunshine]

Thank you so much for all the effort, it is Highly appreciated :)

[@radagon6919]

jod course, liked it very much😀😀😀

[@dhairyataneja3211]

Bhaiya ek computer networks for placements pe bhi bna do...

[@vijaydas420]

I never heard that they ask about CNF in interviews, do they?

[@shoyaishida3605]

they do

[@webseries4u335]

Sir i watched full playlist and help of this video i passed the college exam with nice grade thank you sir and in my 2nd sem I'll watch full dbms playlist ☺️🙂

[@jaydwarkadhish959]

Sir amazing video very nice 😇😇😇😊😊

[@shivammishra6809]

Best playlist Hope next on Computer Network.

[@anishborse1924]

Great efforts, I appreciate your efforts.

[@saurabhbisht9280]

we can use set pair to implement counter .In which first will be the counter and second is value

[@mayankmaloo6893]

we can also implement it by using circular array concept . In the above example as discussed in lecture keep a array of size 3 after each time will update i to (i+1)%3 .

[@HARSHSharma-yf9og]

I mean certain pages would have a valid/invalid bit as 1 since the ram has the capacity to hold three pages according to the said situation.Hence if the pages are present in RAM than the page fault would occur. ONLY in the scenario where all the demanded pages are new that 15 page faults can occur.

[@pravinlife5699]

Thanks bhaiya for this awesome series

[@gauravsinha3032]

Please make video on computer network

[@ayushianderiya396]

What a playlist sir really greatttttt🙌🙌🙌

[@LuckyRathod20]

Amazing..... Thank you bhaiya

[@medhakhatri2840]

Thankyou sir! very useful series

[@motivation_with_harsh]

thankyou so much sir for your efforts i highly appreciate your hardwork

[@shindeprem228]

LRU ka counter wale approach ko implement krne ke liye hashmap use krna hai kya

[@reisewithNeelam]

Valuable series . Thankyou...

[@siddhantsingh2937]

How will you remove pages from the end of the stack in case of LRU

[@ankushladani496]

Maja aa gaya bhai....

[@srajittanwar636]

Was waiting for it🔥

[@soumiksarkar2119]

Why cant we use a queue instead of stack in LRU?

[@UECAshutoshKumar]

Thank you 😊

[@CodeWithBro]

completed whole playlist in one day, exam time killls now going to sleep

[@prajjawalsingh4952]

class Node { public: int a, b; Node *pre; Node *next; Node() { pre = NULL; next = NULL; a = -1; b = -1; } }; class LRUCache { public: map mp; Node *head = new Node(); Node *tail = new Node(); int cap; LRUCache(int capi) { this->cap = capi; head->next = tail; tail->pre = head; mp.clear(); } void add(Node *a) { a->pre = head; Node *rt = head->next; a->next = rt; head->next = a; rt->pre = a; } void deletenode(Node *a) { Node *pr = a->pre; Node *nx = a->next; pr->next = nx; nx->pre = pr; } void put(int a, int b) { if (mp.find(a) != mp.end()) { deletenode(mp[a]); add(mp[a]); mp[a]->b=b; return ; } if (mp.size() == cap) { mp.erase(tail->pre->a); deletenode(tail->pre); } Node* p=new Node(); p->a=a; p->b=b; add(p); mp[a]=p; return ; } int get(int a) { if (mp.find(a) == mp.end()) return -1; deletenode(mp[a]); add(mp[a]); return mp[a]->b; } }; LRU CATCHE iMPLEMENTATION

[@aka_akaran]

Nice Efforts in the series. By far one of the best.

[@ayushgupta8538]

Thanks for this amazing lecture

[@Ankit.yt_885]

Amazing series!

[@MrCoder-q1y]

can we implement the lru with mean heap with custom ??

[@chandrachurmukherjeejucse5816]

Implemented LRU Cache 👍🏻

[@harshalwaghmare440]

Awsome Series Lakshay Sir

[@chaitanyasawant776]

Mai abhi mobile par video dekh raha hun, time abhi 22:16 hai video mai, from start till this point I'm only seeing "In Japan" picture on the screen. Is this happening only with me?

[@EAREC_SAWAN_KUMAR_CHOUHAN]

Bhaiya maza aa gaya

[@KACodes]

Starting me motivation kam thi kyuki subjective topic hai to neend aati thi... But ab importance samajh aa rahi hai OS ki to ab value pata chali hai is course ki

[@cooldude0321]

08/07/24 page replacement algos cleared++ Lakshay bhaiyaa

[@TechUprise-by-Jyoti]

Thank you bhaiya😇

[@SardarCoder]

Done bhai❤

[@Solar.talk07]

Amazing course 👍

[@adityakeshari2295]

Can simply use a priority queue for lru

[@sarthakbehera8324]

cat aagyi pichhe se😁😁 12:58

[@gopalagrawal8378]

Is this playlist is completed for placement?

[@alexrcrew1975]

yes

[@GuruPrasadShukla]

implement kr li bhaiya

[@dipikasrivastava0204]

Very nice video

[@sumitsakpal7085]

Maine Video Pura dekha

[@parthrastogi572]

to kya kare? Prasad de? 😂😂

[@rishav144]

lakshya ...the best

[@fazerugbrug439]

superb

[@alfeztintoiya3506]

plz Computer networks ki playlist laao bhaiyaa

[@Geetanjalichawla]

Present 🙋🏻‍♀️

[@shubhampokhriyal8491]

great 🔥🔥

[@NavneetKumar-nt8mc]

prioirty queue se implement ho jaiga

[@Newindia78610]

nice series

[@ajaykumarsah6276]

Great 👍👍👍👍

[@HARSHSharma-yf9og]

I think there are less page faults than 15 in FIFO.

[@kumarpawansahh]

awesome

[@ShivamKumar-yn9wb]

this series doesnt has system calls.please add

[@parthrastogi572]

Hai

[@AbhishekKumar-dl6ko]

Day 29 done ...10/06/24

[@shivgupta9240]

Very nice

[@bhaskarmishra8479]

How is LRU different from FIFO?

[@AnmolSingh-rf3zt]

FIFO is about entry of the earliest page. LRU is about earliest usage of a page due to which it is pushed to the stack top even when it is already present in the frames.

[@KratosProton]

great

[@SumitKumarSK]

ye java development mei kaam aayega?

[@alexrcrew1975]

no

[@PradeepKumar-kd1dm]

bhai maza aya khatam krke ye playlist

[@063himanshumishra4]

Bhaiya moj kr diii

[@himansuranjanpatra4940]

Sir make next class on computer architecture & Organization 🙏🙏🙏🙏

[@dibyadutta4525]

bhaiiii ... 😐😐😐😐😣😣😣😣😣

[@alexrcrew1975]

@@dibyadutta4525 ok

[@unknowncenter7822]

🔥🔥🔥

[@tntextreme1965]

Day 29 done✓

[@SURAJKUMAR-bv8vp]

Sir start dbms asap plz

[@mdghufranalam7369]

🙏😍

[@Aditya-rs5dj]

Implemented

[@harshmehta1282]

In a way we can say that (iv) Counters method is a Doglapan 😂

[@indianbrave]

😂😂😂 true

[@landojagdis4159]

implemented

[@MSDHONI___]

*****

[@shantanuhallur6825]

Comment++

[@himanshugoyal3158]

most impotent😂😂

[@AnuMessi10]

🔥🔥🔥