Class Schedule
Introduction to Algorithmic Analysis
- Jan 10
- LectureWhy are we here?
- CLRS 1.1, 1.2
- HW0 releasedHW0
- Jan 12
- LectureKaratsuba’s Algorithm & Pseudocode Practice
- Jan 14
- LectureInsertion Sort, Proofs, and Formal Big-Oh
- Jan 16
- Homework Due @ 11:59pmHW0
Big-oh - How do you understand what's possible?
- Jan 17
- No LectureMLK Holiday
- HW1 releasedHW1
- Jan 19
- LectureAsymptotics and Worst-Case Analysis
- Jan 21
- LectureMergeSort and Introduction to Recurrence Relations
Sorting - How can you organize data?
- Jan 24
- LectureMaster Theorem
- Jan 25
- Homework Due @ 11:59pmHW1
- Jan 26
- LectureSubstitution Method and Selection Problem Intro.
- HW2 releasedHW2
- Jan 28
- LectureMedian Selection
Divide and Conquer
- Jan 31
- LectureMedian of Medians
- Feb 1
- Homework Due @ 11:59pmHW2
- Feb 2
- LectureRandomized Algorithms and QuickSort
- HW3 releasedHW3
- Feb 4
- LectureQuickSort and Non-Comparison Sorts
Data Structures - How to efficiently organize data in databases
- Feb 7
- LectureRadix Sort and Wrap-Up
- Feb 9
- LectureSelf-Balancing BSTs
- Homework Due @ 11:59pmHW3
- HW4 releasedHW4
- Homework Due @ 11:59pmHW3
- Feb 11
- LectureHashing and Hash Tables
- Feb 14
- No LectureFree Day
Graphs - How you model relations in the world and explore graphs?
- Feb 16
- LectureUniversal Hash Families and Intro to Graphs
- Homework Due @ 11:59pmHW4
- HW5 releasedHW5
- Homework Due @ 11:59pmHW4
- Feb 18
- LectureGraph Representations and Depth-First Search
- Feb 21
- LectureApplications of Depth-First Search
- Feb 23
- LectureBreadth-First Search
Graphs II - Advanced Graph Algorithms
- Feb 25
- LectureStrongly Connected Components
- Homework Due @ 11:59pmHW5
- Feb 28
- LectureSCCs in Linear Time, Weighed Graphs
- Mar 18
- LectureDijkstra’s Algorithm
Midterm & Spring Break
- Mar 2
- LectureMidterm Review
- Mar 4
- Exam In-Class Midterm
- Mar 7
- No Lecture Start of Spring Break
- Mar 14
- No Lecture Free Day
- Mar 16
- LectureMidterm Overview
- HW6 releasedHW6
Dynamic Programming - How do we solve big problems using subproblems?
- Mar 21
- LectureDynamic Programming I with Bellman Ford
- Mar 23
- LectureDynamic Programming II with Fibonacci
- HW7 releasedHW7
- Mar 25
- LectureDynamic Programming III with Floyd-Warshall
- Homework Due @ 11:59pmHW6
- Mar 28
- LectureDynamic Programmig IV - LCS, Unbounded Knapsack
- Mar 30
- LectureDynamic Programming V - 0/1 Knapsack, Independent Set
Greedy Algorithms - When can we be greedy?
- Apr 1
- LectureActivity Selection and Scheduling
- Homework Due @ 11:59pmHW7
- HW8 releasedHW8
- Homework Due @ 11:59pmHW7
- Apr 4
- No Lecture Free Day
- Apr 6
- LectureQuiz Review
- Apr 8
- LectureActivity Selection, Scheduling, and Huffman Coding
- Apr 11
- LectureMinimal Spanning Trees
Network Flow - Graphs and Flow Problems
- Apr 13
- LectureKruskal’s Algorithm and Max Flow
- Homework Due @ 11:59pmHW8
- HW9 releasedHW9
- Homework Due @ 11:59pmHW8
- Apr 15
- No Lecture University Holiday
- Apr 18
- No Lecture Mental Health Day
- Apr 20
- LectureMax Flow and Minimum Cuts
- Apr 21
- Homework Due @ 11:59pmHW9
- Apr 22
- LectureMax Flow, Minimum Cuts II
- HW10 releasedHW10
- Apr 25
- LectureDeferred Acceptance
Advance Topics - How to solve hard problems?
- Apr 27
- LectureAdvanced Topics I
- Apr 29
- LectureAdvanced Topics II
- Homework Due @ 11:59pmHW10mo
Review
Final Exam
- May 11
- ExamFinal Exam