Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE MOCK 2017 | Question 58

  • Last Updated : 14 Feb, 2018

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-

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

  • 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”

(A) 7
(B) 9
(C) 11
(D) 13

Answer: (C)


Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!