Of pages of the page table 2 outer page table 2 22 2 12 2 10 pages.
Two level page table size.
238 bytes offset or displacement field in pa.
This is two level paging because here we got 2 page tables.
The logical addresses are 32 bit page size is 4kb and the page entry size is 4 bytes.
It is also known as hierarchical paging.
If so we could repeat this process by paging the top level page table thus introducing another.
Prerequisite paging multilevel paging is a paging scheme which consist of two or more levels of page tables in a hierarchical manner.
From the page size i found out that the offset is 12bits from the 32 of the memory address and that every page has 1024 entries.
212 bytes 4kb page frame number field in pa.
12 bits page size.
Thus the total size of the top level page table is 2 10 entries 2 2 bytes per entry 2 12 bytes 4kb.
With different numbers we could have a very large top level page table.
38 12 26 bits number of physical pages.
For a process is using 1gib address space find out size of 1 level page table and 2 levels page table when page table directory has got 1024 entries.
This fits in one page so there is no reason to split it further.
A page table is the data structure used by a virtual memory system in a computer operating system to store the mapping between virtual addresses and physical addresses virtual addresses are used by the program executed by the accessing process while physical addresses are used by the hardware or more specifically by the ram subsystem.
238 212 226 pa.
Thus we can stop here.
The page table is a key component of virtual address.
2 level page tables physical address pa.
But if still the size of page table is more than.
32 bit virtual address 4kib per page 4b size of page table entrie 1 gib size of address space.
38 bits physical address space.
It asks to compute the memory space needed for a two level page table.