Dynamic Page Replacement: Working Set Example

[@jhoepatrick7872]

For column 7 there should be 2 frames { 0, 3} with 0 at the top. For column 15 there should be 2 frames { 2, 1} with 2 at the top. He's my professor and he updated these slides with the correct anwers, but haven't uploaded the updated video yet.

[@vaishaliranjan4862]

thanks a lot

[@maxwong3903]

thank you, i was thinking why some had an extra frame

[@reyz6222]

Thank you jhoe...

[@dvoraklovelace2801]

Very good professor

[@Cccoast]

This is the best example of a memory management algorithm on the internet. Thank you.

[@DePaulo6699]

Thank you, greetings from Minas Gerais State, Brazil.

[@wnualplaud2132]

I have a question at the column 7. Since the working set is {0, 3}, why does the array still keep 0, 3, 2? 2 should be discarded?

[@agf_1984]

same question here

[@C0reDefender]

the page being requested (which in this case is 0) is already present in the array and thus no other page needs to be replaced to make space for it. No page fault occurs as it's a hit.

[@gonfreecs8174]

Yes, i think you are right, as i could see, basically you just take the last three (and if the page repeats, just add it one time). So in that case (from left to right) you have 0 - 3 - 0, and the set will be {0,3}

[@JoseAguirre-ri8tg]

I'm positive the array should be 0 3 as well since the working set was 0 - 3 - 0, like he did in column 10 where he had 4 - 2 - 2 as a working set. It's kind of a contradiction.

[@sree0801]

Saved my time. Thank you so much.🤗

[@weiqin1126]

Thank you sir this is clear and concise.

[@ismail8973]

Thanks sir saved my time for my semester exam

[@nida1198]

Thank you so much... this was very helpful.

[@brawlstar111]

Thanks from BUET

[@abugslife2461]

Very helpful, thank you!

[@sakunthalanagarathinam]

thanks sir super

[@diwang4572]

Thank you!

[@SHASHANKRUSTAGII]

thanks

[@elrey5671]