2nd Chance Algorithm Example

In this video, I will give another example of the 2nd chance page replacement algorithm. It will include many of the nuances you will face and how to solve them.

[@erdmst2511]

You are the best'!!! Keep up the good work. I passed my Operating Systems quiz thanks to you. I can't thank you enough!!!! Greatings from Turkey !!!

[@SarahJohnson-qi9dm]

Just helped me so much with my final exam tomorrow, thank you!

[@Maria-md4po]

thank you soo much , im glad that you included all the conditions in one question itself

[@bilalkhanalizai]

Very nice video, Casey. In column 6, should it not be a page fault when page 7 gets loaded for the first time? I noticed there is no star with page 7 :)

[@muzisyenruhlu3754]

bro where are u from that's turkish english ı think

[@bilalkhanalizai]

@muzisyenruhlu3754 if your question is for me then I am Pakistani by origin but I live in the US (California)

[@damageddude]

lol whats wrong about his english?@@muzisyenruhlu3754

[@mahmutsezgin5745]

nice example with all conditions, clear explanation

[@caseygong6405]

this output has no difference with purely FIFO... I still dont get it

[@hobinh8744]

thank you so much, i cannot understand when i study at school but you help me a lót

[@adilchaouch3513]

Thank you! very instructive and clear

[@Inetgrl361]

How do I find out which page is the oldest, when I just iterate through the reference bit vector (which I do with this algorithm, right?)?

[@플덩이]

It's a perfect example. Thank you

[@Alex-ut4cc]

u miss an default page for the first 7

[@ramizkaraeski586]

Huge thanks Miss.

[@ismailhadjir9703]

Thanks for this detailed explanation

[@Moemenmekadmini]

Great explanation

[@tebes11]

This exemple is wrong. In the classic second chance algorithm after inserting new data into a frame the reference bit must be set to 1. When starting at frame 0 after inserting 4 into the frame we have to set the reference bit to 1 in this frame. There is also a pointer showing which frame is the candidate frame (victim frame) to insert data at the next page fault. So a the the beginning all the reference bits a set to 0 and the pointer is set to frame 0. Inserting 4. Setting reference bit to 1. Moving pointer to the next frame (in this case frame 1). When there is no page fault the frame where the value is locate will have it bit set to 1 if not already. The pointer will still be set to the last frame in date.

[@sebastianlv857]

thats a different implementation

[@comicmania76]

That was good! Thanks Mam!

[@yesbolbavarkhan9275]

thank you a lot 👍

[@יקירמעודה]

wow thank you!!!

[@Anis_dhia]

Thank you :)

[@尺Eム卩E尺]

Thank you

[@imadeddineterraf2587]

Thanks

[@naziur_riaz]

thanks a ton

[@muzisyenruhlu3754]

smooth

[@Serkanjim]

thank u

[@majdme842]

Great great great

[@oussamaXbs]

u gave the worst example

[@massyliasarahaityahia]

thank you so much 🙏

[@year6412]

thank you