2nd Chance Algorithm Example 

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 !!!

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

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.

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

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 :)

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

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

nice example with all conditions, clear explanation

It's a perfect example. Thank you

Thanks for this detailed explanation

u miss an default page for the first 7

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?)?

Thank you! very instructive and clear

Great explanation

That was good! Thanks Mam!

wow thank you!!!

Huge thanks Miss.

thank you so much 🙏

Thank you

Thank you :)

thanks a ton

thank u

Thanks

smooth

Great great great

u gave the worst example

thank you a lot 👍

thank you