Problem 1: Memory management and paging* Suppose the page table for a process cu

Question

Problem 1: Memory management and paging* Suppose the page table for a process currently executing on the processor looks like the following. All addresses are memory byte addresses and addresses in the main memory and processes start from zero. The page size is 512 bytes. (10 marks) 1. Virtual page Valid bit+ Page frame numbere numbere 2+ What physical address, if any, would each of the following virtual addresses correspond to? (Do not try to handle any page faults, if any). (i) 152+ (ii) 1121 ii 2499 2. Consider the following segment table Segment Base Limit+ 219 600 2300P 90- 100+ 1327P 580 1952 96+

Explanation / Answer

Solution:
The first question is done as per Chegg guidelines, please repost others.

i)

152

means page 0 and offset 152

and page 0 is map to page frame number 4

So the physical address would be

00000000 00000000 00000100 | 10011000

which is equal to 1176

ii)

1121/512 = 2 page and 97 frames

which will be map to page frame 1

The physical address

00000000 00000000 00000001 | 01100001

which is 353

iii)

2499/512 = 4 pages and 451 frames

This will map to

page frame number 8

The physical address would be

00000000 00000000 00001000 | 111000011

which is 4547

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---