Code and run your first C++ program about data structures and algorithms in minutes without installing anything!
This course is designed for learners familiar with C++ basics and object-oriented programming. It provides a solid foundation of not just C++, but core data structures and algorithms topics that can be transferred to other languages. The modules in this course cover non-linear data structures like heaps, hash tables (and maps), graphs, and sets.
To allow for a truly hands-on, self-paced learning experience, this course is video-free. Assignments contain short explanations with images and runnable code examples with suggested edits to explore code examples further, building a deeper understanding by doing. You'll benefit from instant feedback from a variety of assessment items along the way, gently progressing from quick understanding checks (multiple choice, fill in the blank, and un-scrambling code blocks) to small, approachable coding exercises that take minutes instead of hours.
Overview
Syllabus
- Heaps
- Welcome to Week 1 of the Non-Linear Data Structures course. You will learn about heaps, priority-queues based on a heap, as well as sorting heaps.
- Hash Tables Maps
- Welcome to Week 2 of the Non-Linear Data Structures course. This module introduces hash tables. You will learn how to build one from scratch, how to reduce and handle collisions, and how hash tables are used in computing. You will also create a restaurant reservation project.
- Graphs
- Welcome to Week 3 of the Non-Linear Data Structures course. You will cover graphs and how to represent them with either an adjacency list or an adjacency matrix. You will cover key concepts like traversal, merging, cycles, shortest path, and spanning trees.
- Sets
- Welcome to Week 4 of the Non-Linear Data Structures course. The final topic is sets. You will cover how to implement and use sets, including the mathematical aspects.
Taught by
Patrick Ester
