Examples that follow the learning path.

L01

Programming & Problem Solving

Minimal program structure and observable output.

Hello, WorldEntry point, output stream, and successful termination.lecture-01-hello-world.cpp

L02

Types & Representation

Range, precision, constants, inference, and conversion.

Sensor packet typesFixed-width integers, floating point, bool, char, auto, and static_cast.lecture-02-types-and-conversions.cpp

L03

Expressions, Scope & Program State

Names, visibility, storage duration, and linkage.

Expressions and scopeNamespaces, precedence, nested scope, and global state.lecture-03-expressions-and-scope.cpp Static and externPersistent local state plus an externally defined value.lecture-03-storage-and-linkage.cpp Shared definitionTranslation-unit definition used by the linkage example.lecture-03-shared-data.cpp

L04

Decisions & Safe Branching

Ordered safety rules and explicit boundaries.

Overcurrent controllerShort-circuit protection logic and ordered classification.lecture-04-overcurrent-controller.cpp

L05

Iteration I · while & Input Validation

Condition-controlled repetition and progress.

Production quality scanA while-loop invariant with a defect-based stopping condition.lecture-05-production-scan.cpp

L06

Iteration II · for, Nested Loops & Invariants

Counted ranges and row–column combinations.

Calibration gridTwo counted loops enumerate every row–column pair.lecture-06-nested-loops.cpp

L07

Functions I · Contracts & Calls

Value parameters, return values, and decomposition.

Function contractsValue parameters and return values for three single-purpose functions.lecture-07-function-contracts.cpp

L08

Functions II · References & Decomposition

References, const access, and call structure.

Order a pairReturn two related results through reference parameters.lecture-08-output-references.cpp

L09

Arrays I · Fixed Sequences & Traversal

Fixed extents, indices, bounds, and traversal.

Weekly temperaturesA fixed array traversed with its actual size as the bound.lecture-09-weekly-temperatures.cpp

L10

Arrays II · Matrices & std::vector

Multiple dimensions and runtime-sized sequences.

Score matrixNested vector traversal with checked row and column access.lecture-10-matrix-vector.cpp Image gridA fixed two-dimensional array rendered through nested traversal.lecture-10-image-grid.cpp

L11

Strings & Text Processing

Owned text, input, classification, and validation.

Enrollment ID validatorPrefix, length, and digit predicates with safe cctype use.lecture-11-enrollment-id.cpp Text as a sequenceA vector of strings rendered line by line.lecture-11-cat-text.cpp

L12

Debugging & Assessment Debrief

Contracts, boundary cases, integration, and regression tests.

Rainfall analyzerFunctions, vector traversal, accumulation, and maximum-index search.lecture-12-rainfall-integration.cpp Boundary testsRepair average calculation and test empty and integer-division cases.lecture-12-boundary-tests.cpp

L13

Records, Pointers & Memory Layout

Structured records, addresses, indirection, and layout.

Sensor recordsArray of structs plus null-safe pointer member access.lecture-13-sensor-records.cpp Structure paddingCompare size, alignment, and field offsets for two layouts.lecture-13-structure-padding.cpp

L14

Dynamic Memory & Linked Structures

Ownership, allocation, smart pointers, and links.

Memory and linked listsRaw allocation, smart pointers, failures, and list operations.lecture-14-dynamic-memory-and-lists.cpp C allocation APImalloc, calloc, realloc, free, and address tracing.lecture-14-c-allocation.cpp

L15

Linear Structures & Array Algorithms

ADTs, search, sort, stacks, and queues.

Linear searchFirst and all matching indices in an unsorted array.lecture-15-linear-search.cpp Array stackLIFO operations as free functions over a plain state record.lecture-15-array-stack.cpp Linked queueFIFO free functions over dynamically linked nodes.lecture-15-linked-queue.cpp Record queueStudent records in a circular-array queue without class prerequisites.lecture-15-record-queue.cpp Elementary sortsBubble, selection, and insertion sort traces.lecture-15-elementary-sorts.cpp

L16

Recursive Decomposition in Practice

Base cases, progress, and linked transformations.

Recursive list reversalMove unique ownership while reversing a linked chain.lecture-16-recursive-list.cpp

L17

Search Trees, Heaps & Sorting

Algorithms that preserve ordering and structural invariants.

Binary searchIterative, recursive, first, and last occurrence variants.lecture-17-binary-search.cpp Binary search treeInsertion, search, deletion, traversals, and cleanup.lecture-17-binary-search-tree.cpp Heap and heap sortHeapify, insertion, extraction, and phased sorting.lecture-17-heap-and-heapsort.cpp Merge sortRecursive and bottom-up merge sort plus inversion counting.lecture-17-merge-sort.cpp

L18

Object Design & Value Semantics

Construction, copying, invariants, and operators.

Complex number valueConstructor, const operator+, value copying, and display.lecture-18-complex-value.cpp

L19

Friend Access & Inheritance Foundations

Narrow privilege and justified is-a relationships.

Calibrated energy meterFriend calibration and a simple public derived class.lecture-19-friend-and-inheritance.cpp

L20

Inheritance & Runtime Polymorphism

Virtual interfaces, safe ownership, and factories.

Employee polymorphismVirtual work behavior through base-class pointers.lecture-20-employee-polymorphism.cpp

L21

Polymorphic Data Structures

Heterogeneous ownership behind a common interface.

Owning shape containervector of unique_ptr, virtual area, and aggregation.lecture-21-polymorphic-shapes.cpp

L22

Applied Object Systems

Domain models, collection algorithms, graphs, and patterns.

Flight booking systemIndex-based associations, route filtering, comparator sorting, factory, and strategy.lecture-22-flight-booking-system.cpp

L23

Recursive & Polymorphic Capstones

Buckets, matrices, trees, and hierarchy applications.

LSD radix sortStable digit passes through an array of buckets.lecture-23-radix-sort.cpp Invert a treeRecursive subtree transformation with unique ownership.lecture-23-invert-tree.cpp Linked Snake gamePlayable turn-based Snake with an explicit segment chain, collision invariants, and ASCII rendering.lecture-23-snake-linked-game.cpp Grid cleaning robotRobot simulation that visualizes vector-queue BFS routes to the nearest dirt.lecture-23-grid-cleaning-robot.cpp Multi-agent graph cleaningObject-oriented cleaners coordinate vector-stored BFS routes and distinct target reservations.lecture-23-multi-agent-graph-cleaning.cpp