helpl understanding page fault algorithm
 

Consider the two-dimensional array A: int A[][] = new int[100][100]; // int is equal to size of the word where A[0][0] is at location 200, in a paged system with pages of size 200. A small process is in page 0 (locations 0 to 199) for manipulating the matrix; thus, every instruction fetch will...