Register

ISRO2016-48

• edited by
8,519 views
5 votes
5 votes

Determine the number of page faults when references to pages occur in the following order:
1, 2, 4, 5, 2, 1, 2, 4
Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used)

  1. 3
  2. 5
  3. 4
  4. None of these
• edited by
User Avatar

4 Answers

Best answer
16 votes
16 votes

Hence,Option(C)4 is the correct choice. 

• selected by
User Avatar
1 votes
1 votes
Just follow LRU with 3 page frames with initially page ref 1,2 stored .It will gives 4 page faults.

Hence,(C) 4  is correct.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

6.5k
views
2 answers
7 votes
Desert_Warrior asked Jul 3, 2016
6,509 views
ISRO2016-49
Working Set $(t,k)$ at an instant of time $t$ isthe set of $k$ future references that the OS will makethe set of future references that the OS will make ... frequencythe $k$ set of pages that have been referenced in the last $t$ time units
User Avatar
8.8k
views
5 answers
20 votes
Kathleen asked Sep 22, 2014
8,842 views
GATE CSE 2009 | Question: 9, ISRO2016-52
In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU
User Avatar
136
views
0 answers
1 votes
Reetu Chaudhary asked May 6
136 views
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when the primary memory ... a) 9 and 7(b) 7 and 9(c) 10 and 12(d) 6 and 7
User Avatar
Link Copied!