Curriculum
Master C++ through interactive visualization. Progress from basic syntax to advanced memory management and the Standard Template Library.
C++ Foundations
5 topics
Introduction to C++
Welcome to the C++ Programming Language.
Compilation Process
How source code becomes an executable.
Namespaces
Organize code and prevent name conflicts.
Data Types
Understand memory size, limits, and casting.
Functions
Build reusable blocks of code.
Memory Fundamentals
5 topics
Pointers
Master memory addresses and direct RAM access.
References
Create aliases for variables and pass data efficiently.
Stack vs Heap
Understand the two distinct areas of computer memory.
Dynamic Memory Allocation
Take manual control of the Heap using new and delete.
Dangling Pointers
The most dangerous bug in C++ and how to avoid it.
Modern Memory Management
4 topics
std::unique_ptr
The modern C++ way to own memory without memory leaks.
std::shared_ptr
Share memory safely using Reference Counting.
std::weak_ptr
Observe shared memory without owning it.
RAII Concept
The core philosophy that makes C++ powerful and safe.
Object Oriented C++
5 topics
Classes & Objects
Model real-world things as data + behavior bundled together.
Constructors
Guarantee objects are always born in a valid state.
Destructors
Guarantee cleanup happens automatically when objects die.
Encapsulation
Protect your data and control access with public & private.
Abstraction
Hide complexity. Show only what the user needs to know.
Advanced OOP
4 topics
Inheritance
Build new classes on top of existing ones.
Polymorphism
One interface, many forms — the heart of OOP.
Virtual Functions
How C++ decides which function to call at runtime.
Operator Overloading
Make your classes work with +, -, ==, << and more.
Object Lifetime & Copy Semantics
1 topics
Generic Programming
1 topics
STL
11 topics
Vector
The dynamic array. Your default container.
List
The doubly-linked list.
Map
Key-Value pairs sorted automatically.
Multimap
A Map that allows duplicate keys.
Set
A sorted collection of unique elements.
Multiset
A Set that allows duplicates.
Queue
First-In, First-Out (FIFO).
Stack
Last-In, First-Out (LIFO).
Priority Queue
The biggest element always stays on top.
Deque
Double-Ended Queue. Fast inserts at both ends.
Unordered Containers
Lightning fast Hash Tables.