STEM / applied
Data structures · Undergraduate · CS / Programming
Topics
Implementation and applications
- Implementing ADTs in C++, Java, or Python with memory/performance tradeoffs
- Graph adjacency lists vs matrices for sparse/dense graphs
- Union–find (disjoint set) for connectivity problems
- Caching and LRU-style eviction (conceptual)
- Benchmarking structures on real datasets
Systems connections
- Memory layout: pointers, references, and object overhead
- Serialization of structures for storage and networking
- Concurrent data structures overview (locks, concurrent maps)
- Choosing structures for pipeline and ETL workloads
- Debugging memory leaks and invalid references
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
Billed in 15-minute increments (15-minute minimum, up to 4 hours). No subscription required.
$60.00 · 60 min · Undergraduate · Online ($60/hr)
Book through intake or schedule a session.