Register

Operating Systems Concepts Page fault using LRU

411 views
1 votes
1 votes
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];
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

509
views
1 answers
3 votes
Sona Barman asked Jan 18, 2018
509 views
LRU page replacement policy
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.
User Avatar
132
views
0 answers
1 votes
Reetu Chaudhary asked May 6
132 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
11.4k
views
4 answers
23 votes
admin asked Feb 15, 2023
11,431 views
GATE CSE 2023 | Question: 47
Consider the following two-dimensional array $\text{D}$ in the $\text{C}$ programming language, which is stored in row-major order:int D[128] ... number of page faults generated during the execution of this code snippet is _______________.
User Avatar
584
views
1 answers
2 votes
admin asked Dec 15, 2022
584 views
DRDO CSE 2022 Paper 2 | Question: 6
Compute the hit rate and miss/fault rate in least recently used page replacement algorithm for the given reference string with $4$ page frames. String: $7 \; 0 \; 1 \; 2 \; 0 \; 3 \; 4 \; 2 \; 3 \; 0 \; 3 \; 2 \; 1 \; 2 \; 0 \; 1$
User Avatar
Link Copied!