How the page faults are handled by an operating system?

Answer 1

We are have a two dimensional array, A: array[0..199,0..199] of characters. The contents of the array are stored in memory in row-major order starting at memory address 200. (i.e. A[0,0] is at address 200, A[0,1] is at address 201, ... A[0,99] is at address 299, A[1,0] is at address 300, etc.). In our computer each page of memory consists of 400 bytes (1 character takes up 1 byte), and there are three physical frames available to a process, one of which is taken up by the code segment currently being run. Assuming only the code segment page is initially loaded into memory, and an LRU page replacement algorithm is being used, determines how many page faults are caused by the array accesses in the following two code segments: // Code Segment A: for(j=0;j<=199;++j) for(i=0;i<=199;++i) A[i,j] = 'x';

// Code Segment B: for(i=0;i<=199;++i) for(j=0;j<=199;++j) A[i,j] = 'x'; // Code Segment A: for(j=0;j<=199;++j) for(i=0;i<=199;++i) A[i,j] = 'x';