Loading page…
Master the fundamental concepts of memory management through this focused micro-challenge.
You have read the whole brief, and the concepts above stay free on every task. Writing and running the code needs a plan.
Three hints are available for this task, revealed one at a time inside the code workspace so you can struggle productively before seeing them.
Every task includes starter code, theory, and hidden tests so you can implement and verify locally in the browser.
How it worksPage tables translate virtual addresses to physical frames. x86 uses multi-level tables: a miss walks levels, a hit comes from the TLB. User processes see contiguous virtual memory; physical frames may be scattered.
For this teaching table:
For example, virtual 0x0040_1000 might map to physical 0x0000_B000 with present bit set and writable clear for a read-only mapping.
The VPN/offset split and present-bit check you implement here are exactly what the x86 MMU performs on every single memory access, and what the CR3 register points to on every context switch. Get the present-bit logic backwards and you turn a clean, recoverable page fault into undefined behavior that silently reads whatever garbage physical memory happens to be there.
Before you call the implementation done, walk failure modes on purpose. Test empty structures, single-element edge cases, maximum concurrency, and errno paths that must not crash the program. OS code usually fails in production when happy-path tests pass but invariants break under contention or memory pressure.
Keep structures small and name fields after kernel counterparts when possible. That lets you read man pages and kernel source side by side while you work. Print observable events during development; remove noisy logs once tests pass reliably.
You will implement map_page, unmap_page, and translate on an in-memory two-level structure. Understanding PTE flags matters because your mini-kernel later installs real tables with the same bits.
Build a page table and translate virtual addresses read from stdin.
Input format (whitespace-separated):
For each query address, compute VPN = addr / page_size and offset = addr % page_size, look up VPN in the table, and print exactly one line:
Success Criteria: