edited by
5,376 views
6 votes
6 votes

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 page fault for the above sequence assuming LRU replacement strategy?

  1. $7$
  2. $4$
  3. $6$
  4. $5$
edited by

4 Answers

4 votes
4 votes
Answer (c):

Through the question may sound ambiguous. But even then if we apply LRU page replacement algorithm using the options, the frames 4 and frames 5 gives more than one page fault.

Thus, 6 frames looks like the best option.
0 votes
0 votes
By taking the option (a) 7, we get single page fault using LRU so the minimum no. of frame required is 7.
0 votes
0 votes
Confirm misses have to be ignored . So by option c) there will be only one page fault due to 7
0 votes
0 votes
option should c.

Explanation :

it is not a demand paging concept means that there are some pages in the memory.  so the question is asking how much frame be assigned to the process should that we have only one pagefault using lru

Answer is 6.
Answer:

No related questions found