Chapter 0 Week 1§ -1.1. Course Introduction -1.1.1. Introduction -1.2. Data Structures and Algorithm Analysis Introduction -1.2.1. Introduction -1.3. Project 1 Design -1.3.1. Project 1 Design -1.3.2. Project 1 Hashing -1.4. Math Background -1.4.1. Math Background
Chapter 1 Week 2§ -1.1. Memory Management -1.1.1. Memory Management -1.2. Project Management -1.2.1. Project Management -1.3. Algorithm Analysis -1.3.1. Algorithm Analysis
Chapter 3 Week 4§ -1.1. Binary Trees Part 1 -1.1.1. Binary Trees Part 1 -1.2. Clean Code -1.3. Binary Search Trees -1.3.1. Binary Search Trees
Chapter 4 Week 5§ -1.1. Project 2 Design -1.1.1. Project 2 Design -1.2. Binary Trees Part 3 -1.2.1. Binary Trees Part 3 -1.3. Over-Constrained Code -1.3.1. Over-Constrained Code -1.4. Comparison -1.4.1. Comparison
Chapter 6 Week 7§ -1.1. Tries -1.2. Sorting: Quadratic Sorts -1.2.1. Quadratic Sorts -1.3. Sorting: Faster Sorts -1.3.1. Faster Sorts
Chapter 7 Week 8§ -1.1. Sorting: Limits to Sorting -1.1.1. Limits to Sorting -1.2. Disk Drives -1.2.1. Disk Drives
Chapter 8 Week 9§ -1.1. Project 3 Design -1.1.1. Project 3 Design -1.2. Buffer Pools -1.2.1. Buffer Pools