Data structures
Data Structures Reloaded
Implementations with invariants written first, tests second, optimisations last.
Cohort 8 weeks · cohort Intermediate
740 GEL
Informational price—final fees appear on your admissions letter.
Request information
Balanced trees, heaps, and hash maps are taught as contracts. You maintain a living invariants sheet for every structure you ship.
- Invariant cards for AVL rotations
- Heapify race exercises
- Collision policy lab for hash maps
- Mutation logs for persistent structures intro
- Pair debugging on failing property tests
- Annotated standard library readings
- Showcase: rebuild a priority queue for a batch job
- State invariants before touching pointers
- Choose heap flavour based on operational profile
- Document structural sharing trade-offs
Tekla Orjonikidze
Practice lead for low-level structure labs.
Which languages?
Rust or C++ recommended; Java acceptable with extra GC notes.
Hardware expectations?
8GB RAM minimum for local fuzzing tasks.
What is not covered?
Lock-free concurrency and memory-mapped files are out of scope.
“Anonymous: the AVL invariant cards from Data Structures Reloaded ended up in our onboarding wiki.”
Client in logistics “★★★★☆ — solid labs; would enjoy one more week on persistent intro, but heaps section was crisp.”
Nika · Teaching assistant · 4/5 · Trustpilot 