edited by
530 views
1 votes
1 votes

Consider the two-dimensional array A$:$

int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that manipulates the matrix resides in page 0 (locations 0 to 199). Thus, every instruction fetch will be from page 0. For three pages frames, how many page faults are generated by the following array-initialization loops, using LRU replacement and assuming that page frame 1 contains the process and other two are initially empty?

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

Please log in or register to answer this question.

Related questions

3 votes
3 votes
1 answer
2
Sona Barman asked Jan 18, 2018
457 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.
1 votes
1 votes
1 answer
3
dragonball asked Jan 12, 2018
359 views
Could anyone give an example.
2 votes
2 votes
0 answers
4
Prajwal Bhat asked Dec 27, 2016
947 views
A.11B.12C.13D.14Couldn't visualize how counter is assigned and how page is exactly replaced based on counter.Visual representation would be helpful rather than just ans!