Algorithm and Data Structure

Determine for the following code how many pages are transferred between disk and main memory, assuming each page has 256 words, the active memory set size is 4096 (i.e., at any time no more than 4096 pages may be in main memory), and the replacement strategy is LRU (the Least Recently Used page is always replaced):also assume that all two-dimensional arrays are of size (1:4096, 1:4096), with each array element occupying one word, N = 4096 for I:= 1 to 4096 do for J:= 1 to 4096 do {A[I, J]:= A[I, J] * B[I, J]:B[I, J]:= C[N - I + 1, J] * A[I, J]} provided the arrays are mapped into the main memory space in row-major order, in column-major order