Paging:
a)A program’s segments can vary in length.
b)Under paging, a program is broken into fixed-length pages. Page size is generally small (perhaps 2K to 4K), and chosen with hardware efficiency in mind.
c)Like segments, a program’s pages are loaded into noncontiguous memory.
d)Addresses consist of two parts , a page number in the high-order positions and a displacement in the low-order bits.
e)Addresses are dynamically translated as the program runs. When an instruction is fetched, its base-plus displacement addresses are expanded to absolute addresses by hardware.
f)Then the page’s base address is looked up in a program page table (like the segment table, maintained by the operating system) and added to the displacement.