Page Replacement Algorithm #Virtualgate

Question

A.11

B.12

C.13

D.14

Couldn't visualize how counter is assigned and how page is exactly replaced based on counter.Visual representation would be helpful rather than just ans!

Comments

is answer 12?

---

No,given as 14

---

what will happen when all the page frames have the same counter value initially

---

whatever way m trying answer is coming out to be 13 only?

---

we can do it in 2 ways...first assign each frame a counter and increment it each time we get a request...in this way we'll get 13 pagefaults
but here i haven't considered the fact of decrementing the counter...

if we decrement also,each time a page is not referred for that frame..then it will eventually turn out to be FIFO only..so again 13 page faults..

---

correct answer would be 15 page faults

---

i know how u reached 15...but then whats the use of this question and implementing a counter..simply do FIFO..u'll get even less page faults;

---

if you do optimal replacement you will get even less page faults. but the question is to find out what is the answer according to the given algorithm. so just confine yourself to the question. why thinking too much?