This fits in one page so there is no reason to split it further.
Two level page table size.
Thus the total size of the top level page table is 2 10 entries 2 2 bytes per entry 2 12 bytes 4kb.
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.
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.
Thus here our outer page table page table 2 can be stored in one frame.
It is also known as hierarchical paging.
212 bytes 4kb page frame number field in pa.
But if still the size of page table is more than.
38 12 26 bits number of physical pages.
Of pages of the page table 2 outer page table 2 22 2 12 2 10 pages.
With different numbers we could have a very large top level page table.
238 bytes offset or displacement field in pa.
38 bits physical address space.
The logical addresses are 32 bit page size is 4kb and the page entry size is 4 bytes.
This is two level paging because here we got 2 page tables.
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.
Thus we can stop here.
The entries of the level 1 page table are pointers to a level 2 page table and entries of the level 2 page tables are pointers to a level 3 page table and so on.
If so we could repeat this process by paging the top level page table thus introducing another.
32 bit virtual address 4kib per page 4b size of page table entrie 1 gib size of address space.
12 bits page size.
So size of outer page table 2 10 4b 4kb.
The page table is a key component of virtual address.
2 level page tables physical address pa.