The Gateway to Computer Science Excellence
+1 vote
175 views

Consider the two-dimensional array A$:$

int A[ ] [ ] = new int[100][100]; where A[0][0] is at location 200 in a paged memory system with pages of size 200. A small process that manipulates the matrix resides in page 0 (locations 0 to 199). Thus, every instruction fetch will be from page 0. For three pages frames, how many page faults are generated by the following array-initialization loops, using LRU replacement and assuming that page frame 1 contains the process and other two are initially empty?

for(int j=0;j<100;j++)
    for(int i=0;i<100;i++)
        A[i][j]=0;
in Operating System by Loyal (9.3k points)
edited by | 175 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,651 questions
56,214 answers
194,173 comments
95,424 users