| Date | Topic | Slides | Handout | Reference |
| 09/27/18 | Introduction | intro lec1 | Responsibility | |
| 10/02/18 | Big-Oh, Omega, Theta notation | lec2 | Chapter 3 of CLRS | |
| 10/04/18 | Logic foundations | lec3 | Part II of Book of Proof | |
| 10/09/18 | Proving running time bounds and proving correctness through invariants | lec4 | Chapter 2 of CLRS | |
| 10/11/18 | Mergesort | lec5 | Chapter 2.3, 4.1, 4.2 of CLRS | |
| 10/16/18 | Quicksort, starting divide and conquer | lec6 | Sorting viz | Chapter 7.1, 7.2, 2.3 of CLRS |
| 10/18/18 | More divide and conquer, some other recurrences | lec7 | Chapter 2.3, 4 of CLRS | |
| 10/23/18 | Class cancelled | |||
| 10/25/18 | Binary heaps | lec8 | Chapter 6 of CLRS | |
| 10/30/18 | Midterm1 | |||
| 11/01/18 | Solving question bank, Part 1 | lec9 | ||
| 11/06/18 | Balanced binary search trees, insertion in 2-3 Trees | lec10 | Kempe lecture notes | Chapter 18 of CLRS |
| 11/08/18 | Deletion in 2-3 Trees, Conversion to red-black trees, augmentation | lec11 | Kempe notes 2 | Chapter 12 of CLRS |
| 11/13/18 | Introduction to graphs | lec12 | Chapter 22 of CLRS | |
| 11/15/18 | BFS | lec13 | Bfs viz | Chapter 22 of CLRS |
| 11/20/18 | BFS continued | lec14 | Chapter 22 of CLRS | |
| 11/22/18 | Thanksgiving | |||
| 11/27/18 | Single source shortest path: Bellman-Ford and Dijkstra's algorithms | lec15 | ||
| 11/29/18 | Midterm2 | |||
| 12/04/18 | DFS and topological sort | lec16 | ||
| 12/06/18 | All Questions Answered |