Consider a 32-bit logical address space with the following paging scheme, and each table entry occupies 4 bytes:
page number = 20 bit
page offset = 12 bit
1) how much storage space in MB would be needed for the page table?

Consider a 32-bit logical address space with the following paging scheme, and each table entry occupies 4 bytes:
first level page number: 8 bit
second level page number: 12 bit
page offset: 12 bit
2) how many entries are in the first level page table? how many entries are in the second level page table?
3) how much  space is occupied in memory by the page tables for a process that has 2GB of space allocated (in KB)? Show your working steps.

4) Assume the page table is stored in memory. If a memory reference takes 80 nanoseconds, how long will a paged memory reference take? If we add TLBs, and if 75% of all page-table references are found in the TLBs, what is the effective reference time? (Suppose TLB access time is 2 nanoseconds for a cache hit.)