Address Spaces for Operating Systemss
Address Spaces give each process a private view of memory, so one program cannot read another's data. The OS and hardware translate virtual addresses to physical ones using base and bounds, segmentation or paging. Page tables, a translation lookaside buffer and page replacement let programs use more memory than is physically present.
Stage: Virtualisation of Memory · Part of the Operating Systems roadmap · Last reviewed 19 November 2026
What to learn in Address Spaces
- Translate a virtual address into a physical address using a page table
- Explain how a TLB speeds up address translation
- Compute page table size for a given address width and page size
- Describe what happens on a page fault
- Compare FIFO, LRU and clock page replacement policies
Address Spaces interview questions
What is a page fault and how does the OS handle it?
A page fault occurs when a process touches a virtual page that is not currently mapped in physical memory. The OS finds the page on disk, picks a free frame or evicts one, loads the data, updates the page table and restarts the instruction.
Why is a TLB needed for paging?
Without it every memory access needs an extra memory read to fetch the page table entry. The TLB caches recent translations in hardware, so most accesses skip the table lookup, which makes paging fast enough to use in practice.
Where Address Spaces fits in the Operating Systems roadmap
Address Spaces belongs to the Virtualisation of Memory stage (intermediate level). Address spaces.
Back to the full Operating Systems roadmap