Its number of times the required page is not present in the frame. You can check this to cross verify www.geeksforgeeks.org/page-replacement-algorithms-in-operating-systems/ . mam ila sir than.
(d) Consider the following page reference string: 1, 2, 2, 3, 1, 3, 0, 1, 7, 5, 3, 7, 2, 2, 7, 2, 1, 2, 3, 1. (i) Considering page reference string, draw the reference sequence and calculate how many page faults would occur for the following replacement algorithms, assuming three frames? a) FIFO replacement b) LRU replacement c) Optimal replacement (ii) Considering page reference string, draw the reference sequence and calculate how many page faults would occur for the following replacement algorithms, assuming four frames? d) FIFO replacement e) LRU replacement f) Optimal replacement (iii) Compare the page fault rates in part (i) and (ii). here part (ii) (f) part, igot answer like 5237 after i change 5 as page replacement. now 3,7,2,2,7,2 wont change, the i have to replace the 1 as page replace but in the future i have 2,3,1 in reference string, so now what should i do with that sir, like FIFO consider pannanuma ipo? apdi consider panna, which one should be replace in 5237? 23 in future so 5 or 7? sir naa up to down add pannitu vanthen page replacement, neenga pannathuku opposite direction. athukku aprom vara 1 ayum sollung sir replace rthoda pannanumnu
Hi, its tough to get what you are exactly asking. Can you plz mail me the image of what you have tried? venkat.kvhapp@gmail.com I will check and tell you.
Super....mam...best teacher
Thanks a lot. keep learning and keep sharing with your college mates also. Mam ila sir than.
Thank you for your dedication sir😊❤
It's my pleasure. Keep learning and keep sharing.
Thank you so much sir ❤❤❤
Most welcome> keep learning and keep sharing.
How to find the page fault mam ❤
Its number of times the required page is not present in the frame. You can check this to cross verify www.geeksforgeeks.org/page-replacement-algorithms-in-operating-systems/ . mam ila sir than.
Thank you so mam🙏
Most welcome 😊
(d)
Consider the following page reference string: 1, 2, 2, 3, 1, 3, 0, 1, 7, 5, 3, 7, 2, 2, 7, 2, 1, 2, 3, 1.
(i) Considering page reference string, draw the reference sequence and calculate how many page faults would occur for the following replacement algorithms, assuming three frames?
a) FIFO replacement
b) LRU replacement
c) Optimal replacement
(ii) Considering page reference string, draw the reference sequence and calculate how many page faults would occur for the following replacement algorithms, assuming four frames?
d) FIFO replacement
e) LRU replacement
f) Optimal replacement
(iii) Compare the page fault rates in part (i) and (ii).
here part (ii) (f) part, igot answer like 5237 after i change 5 as page replacement. now 3,7,2,2,7,2 wont change, the i have to replace the 1 as page replace but in the future i have 2,3,1 in reference string, so now what should i do with that sir, like FIFO consider pannanuma ipo? apdi consider panna, which one should be replace in 5237? 23 in future so 5 or 7? sir naa up to down add pannitu vanthen page replacement, neenga pannathuku opposite direction. athukku aprom vara 1 ayum sollung sir replace rthoda pannanumnu
Hi, its tough to get what you are exactly asking. Can you plz mail me the image of what you have tried? venkat.kvhapp@gmail.com I will check and tell you.
Mam your is so sweet like china kuyil chitra..😘😘☺
Thank you so much 😀Keep learning. Mam ila sir than.
😂
😂😂
Adei😂😂
Don't repeat this vro 🫸🏼
Sir Page Miss, Page Hit, page fault difference enna
Page miss(Page fault) - The page we are searching is not in memory
Page hit - The page we are searching is in memory
Thank u sir ❤
Most welcome. Keep learning and keep sharing.
super class mam. take trb cs syylabus mam
Thanks wont be possible immediately . Mam ila sir than
Mam empty page fault count varumah varatha mam
I did not understand your doubt. Ask in detail
@@because2022 mam page fault count panurom laa apo empty stack count varumah?!?!
@@MR2324Gaming Empty stack u need not include.
Thank you sir🙏
Most welcome. Keep learning