Algorithms

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