• edited by
10,152 views
5 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

4 Answers

Best answer
18 18 votes

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

• selected by
1 1 vote
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.
Answer:
Position:
Show:

Related questions

9 9 votes
2 answers 2 answers
9.0k
9.0k views
Desert_Warrior asked Jul 3, 2016
8,986 views
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 in next $t$ unit ...
3 3 votes
1 answers 1 answer
9.9k
9.9k views
go_editor asked Aug 16, 2016
9,940 views
Consider the reference string:0 1 2 3 0 1 4 0 1 2 3 4If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frame...
0 0 votes
2 2 answers
1.5k
1.5k views
admin asked Mar 31, 2020
1,452 views
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 th...
6 6 votes
5 5 answers
10.2k
10.2k views
Satbir asked Jan 13, 2020
10,182 views
Consider the following page reference string.$1\ 2\ 3\ 4\ 2\ 1\ 5\ 6\ 2\ 1\ 2\ 3\ 7\ 6\ 3\ 2\ 1\ 2\ 3\ 6\ $What are the minimum number of frames required to get a single ...