# Operating Systems Concepts Page fault using LRU

1 vote
182 views
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];
0
Size of a page? How many array's elements can be present in a page?

## Related questions

1
170 views
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.
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.
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_________(%)