Log In
1 vote
if you have 10 Frames and using LRU how many page fault will be there in both below:

for (int j = 0; j < 100; j++) for (int i = 0; i < 100; i++) A[i][j] = A[i][j] + A[j][i];


for (int i = 0; i < 100; i++) for (int j = 0; j < 100; j++) A[i][j] = A[i][j] + A[j][i];
in Operating System 182 views
Size of a page? How many array's elements can be present in a page?

Please log in or register to answer this question.

Related questions

3 votes
1 answer
Self doubt: What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
asked Jan 18, 2018 in Operating System Sona Barman 170 views
0 votes
1 answer
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 $1$ having been brought earlier than page $2$.(LRU algorithm is used). $3$ $5$ $4$ None of these.
asked Mar 31 in Operating System Lakshman Patel RJIT 110 views
0 votes
1 answer
Consider a system using demand paging architecture it takes $3ms.$ to service page fault if either empty frame is available or replaced page is not to be modified takes $10ms.$ if replaced page is modified. Main Memory access time is $1ms.$ and page to be replaced ... $60$% of time. The maximum acceptable page fault rate to get effective memory access time not more than $4ms.$ is_________(%)
asked May 15, 2019 in Operating System srestha 173 views
0 votes
1 answer
" In the case of LRU, ( and particularly the stack implementation thereof ), the top N pages of the stack will be the same for all frame set sizes of N or anything larger." Can somebody please explain what this means? Please refer :
asked Aug 25, 2017 in Operating System Warlock lord 183 views