Consider the following program which uses demand paging and $1$kB sized pages. In this example an int is $2$ bytes long.

Therefore each array will need $8$ pages to store the data. If this process has been allocated $4$ frames it can use, it will use $1$ frame for the instruction set leaving $3$ for data. Also, two index registers are assigned for i and j $($so no memory accesses are needed for references to these two variables$).$

How often will page faults occur in terms of number of times C$[$i$,$j$]=$ A$[$i$,$j$]+$ B$[$i$,$j$]$ is executed.

Can you modify the program to minimize the page fault frequency?

What will be the frequency of page faults after your modification?