Page tables and virtual memory
Filed under Adobe
Free read 3 of 3Virtual memory gives each process its own large, contiguous-looking address space, mapped onto limited physical RAM and disk. It provides isolation, protection, and lets programs larger than RAM run.
The question
Explain page tables and virtual memory: what problem they solve and how a virtual address is translated to a physical address.
Approach
Virtual memory gives each process its own large, contiguous-looking address space, mapped onto limited physical RAM and disk. It provides isolation, protection, and lets programs larger than RAM run.
Memory is split into fixed-size pages (virtual) and frames (physical), commonly 4 KB. A virtual address is a page number plus an offset; the offset is unchanged by translation.
Each process has a page table mapping page number to frame number, with bits for valid, dirty, referenced and permissions. Multi-level or hashed tables keep large address spaces compact. The TLB caches recent translations to avoid extra memory accesses.
If the page is not in memory, the MMU raises a page fault; the OS loads it from disk (demand paging) and evicts another frame using a policy such as LRU or clock. Too many faults cause thrashing.
Tips
- What they are testing: What is being tested: a clear mental model of address translation, TLB and page faults.
- Common mistake: Confusing the page table (maps pages to frames) with the TLB (a cache of those mappings), or skipping what happens on a page fault.
Related Adobe questions
Collected from public candidate posts and coding forums. Updated Nov 2026.