Skip to content
Atlas
Start
Back to Introduction to programming

Module 03 · Objects and lifecycles in C++

Polymorphism, vtables, and generic containers in C++

Zero-cost abstractions combine runtime dynamic dispatch with compile-time monomorphization. Construct manual vtable dispatch engines, implement generic algorithm pipelines, build open-addressing hash maps with tombstone deletion, and code array-backed min-heaps.

4 lessons · 4 graded exercises·3 hours·intermediate·Prerequisite: RAII, objects, and lifecycles in C++
01

Virtual functions, dynamic dispatch, and vtables

25 min · exercise
How virtual method tables (vtables) and vptr pointers implement runtime polymorphism in C++, memory layout of polymorphic objects, and virtual destructors.
02

Compile-time generics, templates, and algorithms

20 min · exercise
Template monomorphization, generic programming paradigms, STL algorithm iterator abstractions, and compile-time type constraints.
03

Hash tables, open addressing, and collision resolution

25 min · exercise
Designing high-performance hash tables, hash functions, separate chaining vs open addressing, linear probing, tombstone deletion, and dynamic rehashing.
04

Binary heaps and priority queues

20 min · exercise
Array-backed complete binary trees, min-heap properties, sift-up and sift-down mechanics, linear-time heapify, and priority queue ordering.