ANONYMOUS wrote
Honestly it could be interpreted either way, but I don't think you need to increase the last accessed time if you are ignoring the entry since it would presumably take no time to ignore an entry (as opposed to loading an entry onto RA...
It is definitely possible to complete the project without creating virtual memory, but I believe Amitava intends you to create virtual memory (since it is in the specification), so it is probably best to create virtual memory.
Hi, in the project description it says that "time will increase by 1 for each entry in the file". So, do we need to increase last accessed time if we decide to ignore an entry that already exists in RAM?
Thank you for your help
how do i submit if i worked project2 with a partner?
do I have to submit individually or make team's submission as Project 1?
"If working as a team of two, only one team member should make the team's submission."
thank you.
Is it mandatory to maintain a data structure for virtual memory as an array of size 32? Coz I developed all the way without having virtual memory in mind.
ANONYMOUS wrote
As Anon said this is incorrect. The page table is the slot in RAM the page occupies. A slot is of size 2. So, it should be
0, 1, 2, 3
4, 7, 99, 99
99, 99, 5, 99
99, 99, 6, 99
You are getting confused with the location in the RAM array and the page frame in the RAM.
Page tables print which page frame the process page is in, NOT the array index the page starts at.
From the project description
"We have a computer...
Not completely sure what you mean but you don't need to provide code for this question. Recall there are two types caching methods you can use that apply the principle of Locality of Reference and you can use two examples to demonstrate how they can ...