Pretty sure this is not correct. The primary page table size is 2 8 256, where each of these 256 entries points to a secondary page table. Therefore there are 2 8 256 secondary page tables, one for each index of the primary page table. Each of these ...

meant to say the amount of frames is determined by the maximum frame number which is everything left of the offset. so in a 32 bit computer if 10 were for offset then it means that there are up to 2 22 pages and if each of those pages are 2 10 bytes ...

an off set of 10 bits means the page size is 2 10 Bytes which is 1 KB. the amount of pages is determined by the maximum page number. Also, each digit in a memory address represents a byte so a 32 bit computer would have 2 32 unique addresses which is...

Thank you for your reply, I'd like to ask why there'd be 2 14 secondary page tables instead of the size of secondary page table being 2 14. As I understand, primary page table will hold the address to a single secondary page table. Perhaps I'm mistak...

Sorry for the confusion, when the offset is 10 bits, does it mean there are 2 10 bytes, or 2 10 32-bit addresses?

ANONYMOUS wrote good answer, thanks

ANONYMOUS wrote It needs to be consistent so that it is not misused by malicious processes.Complicated interfaces may be easier to manipulate to pass malicious parameters. Also parameter checking is more efficient if they are consistent.

ANONYMOUS wrote page size is 2 10 primary page table size is 2 8 There are 2 14 secondary page tables, each entry of the primary page table holds the starting address of a secondary page table. One can bring the secondary page tables on demand (the sec...

ANONYMOUS wrote Sort of, but you can ignore that question. I don't know what Chris meant, may be segmented paging (I haven't explained that).

The page size is 2 10, but what you have written after that does not make any sense. I guess you haven't spent time to understand the lectures. It is impossible to explain here.

Hi, just a quick question about calculating the page size from the offset. if there are 10 bits for the offset in a 32 bit system, would the page size be 2 10 1kB bytes, where each offset contains 2 bits to determine which byte of the 4 bytes in the...

ANONYMOUS wrote Answered here https secure.csse.uwa.edu.au run help2002?p np opt U753 hl segmentation

"Explain Cleary the difference between paging and segmentation of memory" Hi, in the question above is the segmentation of memory the same thing as partitioning? Thank you

will there be any writing code questions?

Hello, I am reposting my question as it seems my question has been missed. Could someone please clarify or help with my understanding please? The question is below Hi all I'm currently on Past Exam 2021 Question 5. I'm wondering if for """ A computer ...

The stack is "built up" in a sense, so new items are added on top of the stack. When a function returns, the stack essentially (theres a bit more to it if you want to do some research) gets rid of everything that was added on top during the function...

Question about the stack thing, when your saying that the next bit of data we want to get from the stack will be near the top is that in reference to the data in the stack or the location of the data in the stack? I assume the former and thats why a ...

ANONYMOUS wrote (Hint portability)

This is a good response.

ANONYMOUS wrote Hi, What Amitava said is correct and so are the other sources (as well as Anon). A file pointer is a pointer to a file structure, which contains useful information that makes reading writing to files easier. It allows you to treat a f...

I am not Amitava or A lab facilitator so they may have better answers than mine but For examples of referential locality. I would provide the examples of the activation stack and the executable code data. Executable code will frequently be executed...

"What is the primary interface between the C11 programming language and an operating system kernel? With respect to parameter passing, the return of results, and error handling, explain how the interface has been designed to be as consistent as possib...

"With reference to two distinct examples, explain the Principle of Referential locality, and explain how an operating system may use it to improve performance." Hi, in the above question, I am bit confused with the type of examples that would have to ...

I think it's worth noting (and please correct me if you think I'm wrong), that we may have multiple clusters. For example, our code instructions will obviously often cluster particularly when sequential execution, or looping occurs. And independent...

ANONYMOUS wrote From my understanding, file descriptors are low-level system calls USUALLY handled by the operating system that returns a single int which represents the currently opened file. Remember that C is a program that is used to contact dir...

Hello, I went to see Amitava today to ask him about file pointers vs file descriptors, I understand what a file descriptor is but I was told by Amitava that a file pointer is just a pointer that points at the file descriptor. But other sources on goog...

Thank you very much

I meant to say function not program.

ANONYMOUS wrote All good, this question isn't worded well. This is the program you are meant to make. If there are 3 executable programs named ls and 2 named cp that can be found via a PATH environment variable, then the function wil...

For give my poor English, this question really confused me You are asked to write a C11 function to locate and print all potential trojan- horse programs found via a user s PATH environment variable. The C11 function should have the prototyp...

Please state the question because it takes a while for me to find it. But yes, as anon said, assuming all months have 31 days is fine (just make sure you state it when answering the question).

ANONYMOUS wrote Kind of, they are very similar techniques, the only difference is memory segmentation can provide a process with multiple partitions (or segments) whereas dynamic partitioning only provides one partition per process. e.g. With dynamic ...

ANONYMOUS wrote Lecture 15, last 3 pages

Cheers mate

"Three common file allocation mechanisms, in order of increasing complexity, are contiguous, chaining, and indexed. Briefly describe one advantage and one disadvantage of each mechanism." One of our practice papers asks this and I was wondering where w...

ANONYMOUS wrote I'd assume in questions like those where it can be either or. It is important to state our assumption when the question is ambiguous. Amitava doesn't want specific correct answers where it is as precise as possible but rather want us ...

ANONYMOUS wrote "Involving code" means the code will be given and we'll have to either debug explain the code given to us. NO CODE WRITING is necessary. (Look at literally any last 4 lectures and you can find Amitava stating this over and over) That i...

In the lectures it was said the exam would have questions involving code but not as much as previous years' exams. Is there any suggestion on where to look for questions like those that will be in the exam? What would be the recommended method to pre...

Hi, q3a of the 2017 asks about this and I was wondering if my understanding is correct. Is Segmentation of memory just a different way of saying Dynamic Partitioning? Paging stores allocates each process a fixed size in the physical memory whilst seg...

Hi, For Q1 in the 2017 exam, do I assume that all months have 31 days? Thanks

You can give examples of code locality and data locality (e.g., in arrays)

ANONYMOUS wrote No, labs are not scheduled this week, as the semester is over. You can ask questions here, or meet me until Wednesday afternoon.

ANONYMOUS wrote Strictly handwritten. Do not use a tablet, I had a friend that got their printed tablet notes confiscated because they don't look "handwritten" enough. np

As far as I know there are no labs this week. Labs ended last week. You can ask questions on the forum if you need to.

Will the labs still be running this coming week for us to ask questions?

I asked Amitava this and he didn't really comment on the tablet question, but see the response below "I guess it is OK to bring a photocopy, but I have absolutely no connection with the exam office, and I have no involvement in exam invigilation. So ...

Hi, I have a query regarding exam notes. Amitava said the notes are to be 1 double-sided page of handwritten notes. Would that possibly include writing notes on a tablet and printing out a double-sided page, or is it strictly 1 handwritten page on a b...

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 ...

Would this be with using the memory management tools like malloc to create arrays in heap instead of stack and caching variables that get used repeatedly?

With this type of question, you would define and explain the Principle of Referential Locality, then create two scenarios (or examples) that demonstrate how it works and how the OS can use it to improve performance. Ultimately the question is testing ...

Hi, as I understand the principle of referential locality it means that memory references are typically close together. The question asks "With reference to two distinct examples, explain The Principle of Referential Locality, and explain how an operat...