Paging Formula
Paging Formula
The following list of formulas is very useful for solving the numerical problems based on
paging.
For Process-
Size of page table = Number of entries in page table x Page table entry size
Number of entries in pages table = Number of pages the process is divided
Page table entry size = Number of bits in frame number + Number of bits used for
optional fields if any
NOTE-
In general, if the given address consists of ‘n’ bits, then using ‘n’ bits, 2n locations are
possible.
Then, size of memory = 2n x Size of one location.
If the memory is byte-addressable, then size of one location = 1 byte.
Thus, size of memory = 2n bytes.
If the memory is word-addressable where 1 word = m bytes, then size of one location = m
bytes.
Thus, size of memory = 2n x m bytes.
PRACTICE PROBLEMS BASED ON PAGING AND
PAGE TABLE-
Problem-01:
Calculate the size of memory if its address consists of 22 bits and the memory is 2-byte
addressable.
Solution-
We have-
Number of locations possible with 22 bits = 222 locations
It is given that the size of one location = 2 bytes
Problem-02:
Calculate the number of bits required in the address for memory having size of 16 GB.
Assume the memory is 4-byte addressable.
Solution-
Let ‘n’ number of bits are required. Then, Size of memory = 2n x 4 bytes.
Since, the given memory has size of 16 GB, so we have-
2n x 4 bytes = 16 GB
2n x 4 = 16 G
2n x 22 = 234
2n = 232
∴ n = 32 bits
Problem-03:
Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page
size and page table entries of 4 bytes each. The size of the page table in the system in
megabytes is _____.
1. 2
2. 4
3. 8
4. 16
Solution-
Given-
Number of bits in logical address = 32 bits
Page size = 4KB
Page table entry size = 4 bytes
Process Size-
Thus,
Number of entries in page table = 220 entries
Problem-04:
Consider a machine with 64 MB physical memory and a 32 bit virtual address space. If the
page size is 4 KB, what is the approximate size of the page table?
1. 16 MB
2. 8 MB
3. 2 MB
4. 24 MB
Solution-
Given-
Size of main memory = 64 MB
Number of bits in virtual address space = 32 bits
Page size = 4 KB
We have,
Page size
= 4 KB
= 212 B
Thus, Number of bits in page offset = 12 bits
So, Physical address is-
Process Size-
Problem-05:
In a virtual memory system, size of virtual address is 32-bit, size of physical address is 30-
bit, page size is 4 Kbyte and size of each page table entry is 32-bit. The main memory is
byte addressable. Which one of the following is the maximum number of bits that can be
used for storing protection and other information in each page table entry?
1. 2
2. 10
3. 12
4. 14
Solution-
Given-
Number of bits in virtual address = 32 bits
Number of bits in physical address = 30 bits
Page size = 4 KB
Page table entry size = 32 bits
Maximum number of bits that can be used for storing protection and other information
= Page table entry size – Number of bits in frame number
= 32 bits – 18 bits
= 14 bits