edited by
622 views
3 votes
3 votes

In a 32-bit machine we subdivide the virtual address into 4 segments as follows:
 

10-bit

8-bit

6-bit

8 bit

We use a 3-level page table, such that the first 10-bit are for the first level and so on. Page Table Entry Size is 2B

  1. What is the size of a page table for a process that has 256K of memory starting at address 0?
  2. What is the size of a page table for a process that has a code segment of 48K starting at address 0x1000000, a data segment of 600K starting at address 0x80000000 and a stack segment of 64K starting at address 0xf0000000 and growing upward
  3. What would be the change when the memory is nibble addressable ?
edited by

Please log in or register to answer this question.

Related questions

1.4k
views
1 answers
0 votes
Markzuck asked Dec 22, 2018
1,416 views
for memory overhead in Multi level paging, for innermost table only 1 page size shall be counted na? and NOT the complete page table size?please explain the concept, than...
1.1k
views
2 answers
2 votes
Ashwin Kulkarni asked Jan 23, 2018
1,093 views
Consider a byte addressable virtual memory system with 34-bit addresses where the first 23 bits are used as a page number, and the last 11 bits is the offset. Suppose the...
7.0k
views
2 answers
1 votes
royal shubham asked Dec 6, 2017
7,033 views
Paging increases context switch time how and why ???
605
views
0 answers
1 votes
rahul sharma 5 asked Dec 6, 2017
605 views
Does inverted page table takes less memory to store a processes as compared to single/multilevel paging?Please explain reason also