help2002

It's UWAweek 42 (2nd semester, week 12)

help2002

This forum is provided to promote discussion amongst students enrolled in CITS2002 Systems Programming.
Please consider offering answers and suggestions to help other students! And if you fix a problem by following a suggestion here, it would be great if other interested students could see a short "Great, fixed it!" followup message.

Displaying selected article

Showing 1 of 738 articles.
Currently 29 other people reading this forum.

UWA week 42 (2nd semester, week 12) ↓

2nd project Output verification (all 12)

8:17pm Mon 14th Oct, ANONYMOUS

ANONYMOUS wrote:

> Hi, no this this should not be the case. Note that a process will always replace one of its own pages if the RAM is full and there is one available to replace (as local replacement is prioritised over global). > > As a result of this, once 1 page of each process is in the RAM and the RAM is full each process will have a consistent number of pages. In this case you would end up with 3 process 0, 2 process 1 pages, 2 process 2 pages and 1 process 3 page. > > You are correct that you can update the last access time of the page 0 process 0 after the 5th 0 though.

Noted, I've made the changes. Could you verify if this should be the correct output? Thanks! in.txt 0 0 0 0 0 1 1 2 2 3 3 2 2 1 1 out.txt 0, 99, 2, 3 99, 99, 4, 5 99, 99, 6, 7 99, 1, 99, 99 RAM Contents: 0,0,4; 0,0,4; 3,1,10; 3,1,10; 0,2,2; 0,2,2; 0,3,3; 0,3,3; 1,2,13; 1,2,13; 1,3,14; 1,3,14; 2,2,11; 2,2,11; 2,3,12; 2,3,12