You're very welcome! 🥰 Of course, this is a technical concept in Operating Systems. It is a must that we must explain the concept in the simplest way possible so that our students can understand. God Bless!
You're very welcome! 🥰 I am really flattered that my content is better than published books made by seasoned professors in Computer Science/IT. God Bless!
Thank you for this great explanation! Optimal equals the least amount of page faults but can you help me understand a scenario where it can be feasibly implemented?
You're very welcome! 🥰 I am really glad to hear that it helped you understand the Page Replacement Algorithms. God Bless! For your question, please let me get back and update you about this.
![[OPERATING SYSTEMS] 10 - Virtual Memory](http://i.ytimg.com/vi/mduWNA6_BU8/mqdefault.jpg)
![[OPERATING SYSTEMS] 10 - Virtual Memory](/img/tr.png)
God bless you. You have explained this better than my professor ever did
Thank you so much, you went into more detail than my professor and I understand FIFO completely now. :)
You're very welcome! 🥰 Of course, this is a technical concept in Operating Systems. It is a must that we must explain the concept in the simplest way possible so that our students can understand. God Bless!
Great explanation and also nice hand writing
Thanks a lot 😊
Thanks for informative video about Page replacement algorithms in a very nice way with a proper practical example. ❤
This is wonderful. Thank you so much for the assistance.
You're welcome! I am hoping that my content helped you. 😊
Thank You maam for an amazing presentation and clear explanation of this. Really saves my day.
You're most welcome! 😊 It really fills my heart that you understood the page replacement algorithms because of my material.
You've really explained it so well, books are bit confusing. Thank You☺
You're very welcome! 🥰 I am really flattered that my content is better than published books made by seasoned professors in Computer Science/IT. God Bless!
Thanks for informative video, you saved me
you re the best👍👍👍👍👍👍👍👍👍
Thank you very much!
thank you so much for this
You're very welcome! 😊
best explaination thanks.
You're very welcome! 🥰 I am really glad to hear that it helped you understand the Page Replacement Algorithms. God Bless!
Thank you for this great explanation! Optimal equals the least amount of page faults but can you help me understand a scenario where it can be feasibly implemented?
You're very welcome! 🥰 I am really glad to hear that it helped you understand the Page Replacement Algorithms. God Bless!
For your question, please let me get back and update you about this.
ThankYou So much ☺️
Thank you very much.
You're welcome! 🥰
Thanks!
You're very welcome! 🥰 I hope that you learned something from this lecture. God Bless!
why did you choose 3 frames ??? can I choose another number of frames?
Yes, you can any number of frames.
How about Clock Replacement Algorithm may video ka po?
thannnnnkkkkkk youuuuuuuuuu souuuuuuuu muchhhhhhhhhh, honestly
You're very welcome! 🥰 I hope that you learned something from this tutorial. God Bless!