0 0 votes Consider the following program fragment that deals with a table $\mathrm{T}$ with $17$ rows and $1024$ columns, computing an average for each column and printing it to screen ( $\mathrm{i}$ is row index and $\mathrm{j}$ is column index): for $\mathrm{j}=[0 \ldots 1023]\{$ temp $=0$ for $\mathrm{i}=[0 \ldots 16]$ temp $=$ temp $+T[i][j]$ print ( temp/ 17.0); } $\mathrm{T}$ [i] [j] and temp are $32$ bit floating point values and memory is word addressable. The temporary variable temp is kept in a processor register so access to temp does not involve a memory reference. The main memory is page and holds $16$ pages of size $1024$ words, the page replacement policy is "least recently used ", If $\mathrm{T}$ is stored in the virtual address space in row major format. How many page faults will be encountered? $16,402$ $17,408$ $18,208$ $18,608$ Programming and DS ugcnetcse-june2023-paper2 page-replacement programming-in-c array output memory-management + – admin 374 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.