+1 vote
170 views

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 | 170 views
+1

2
+1 vote