Linked Questions 58-59
Assume GeeksforGeeks implemented the new page replacement algorithm in virtual memory and given its name as ‘Geek’. Consider the working strategy of Geek as following-
- Each page in memory maintains a count which is incremented if the page is referred and no page fault occurs.
- If a page fault occurs, the physical page with zero count or smallest count is replaced by new page and if more than one page with zero count or smallest count then it uses FIFO strategy to replace the page.
Find the number of page faults using Geeks algorithm for the following reference string (assume three physical frames are available which are initially free)
Reference String : “A B C D A B E A B C D E B A D”