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 the 3 articles in this topic
Showing 3 of 738 articles.
Currently 194 other people reading this forum.


 UWA week 41 (2nd semester, week 11) ↓
SVG not supported

Login to reply

👍?
helpful
12:54pm Fri 11th Oct, ANONYMOUS

Hi, I have the following questions about Project 2. 1. Based on the response in the post linked below which states that a process can only be loaded once, does this mean that after the fourth page (with page number 3) of a process has been loaded into RAM, no more pages of that process can be loaded into RAM (i.e. further appearances of the process in in.txt will be ignored after the fourth page of the process has been loaded into RAM)? 2. I have seen a response in a previous post state that we simply "move" pointers in and out of RAM. But in my solution, before any pages are loaded into RAM, I initialise the RAM by filling it with struct pointers such that the fields (process_id, page_num, last_accessed) are all set to -1. After this, I don't "move" any pointers in and out of RAM when I load a page as I just update the fields in the structs in the appropriate RAM array locations. Is what I am doing acceptable? Thank you


SVG not supported

Login to reply

👍?
helpful
2:48pm Fri 11th Oct, ANONYMOUS

Sorry, I forgot to link the post in my first question [help2002]


SVG not supported

Login to reply

👍?
helpful
5:32pm Fri 11th Oct, Joshua N.

Answered here: [help2002]

The University of Western Australia

Computer Science and Software Engineering

CRICOS Code: 00126G
Written by [email protected]
Powered by history
Feedback always welcome - it makes our software better!
Last modified  8:08AM Aug 25 2024
Privacy policy