Welcome to introductory algorithms. We have four main sections.
We will follow the book Algorithms by Dasgupta, Papadimitriou, and Vazirani but there are other excellent books:
I may occasionally pull from these books. I recommend you follow and read the DPV book.
This is subject to change as I realize what takes more or less time.
Date | Subject | Reading (book) | Reading (PDF) | Notes |
---|---|---|---|---|
01/10/23 | Introduction | pg 1-10 | pg 11-19 | notes |
01/12/23 | Arithmetic | pg 11-15,45-47 | pg 21-24,51-53 | |
01/17/23 | Divide and Conquer | pg 48-54 | pg 54-59 | |
01/19/23 | Cryptography | pg 23-34 | pg 28-42 | notes |
01/24/23 | Fast Fourier Transform | pg 57-70 | pg 64-78 | notes |
01/26/23 | Topological Sorting | |||
01/31/23 | Review | |||
02/02/23 | Exam 1 | |||
02/07/23 | Strongly Connected Components | |||
02/09/23 | Kruskal's Algorithm | |||
02/14/23 | Dijkstra's Algorithm | |||
02/16/23 | Max Flow Min Cut Theorem | |||
02/21/23 | Review | |||
02/23/23 | Exam 2 | |||
02/28/23 | Dynamic Programming | |||
03/02/23 | Dynamic Programming | |||
03/07/23 | Dynamic Programming | |||
03/09/23 | Dynamic Programming | |||
03/14/23 | Review | |||
03/16/23 | Exam 3 | |||
03/28/23 | NP-completeness | |||
03/30/23 | NP-completeness | |||
04/04/23 | NP-completeness | |||
04/06/23 | NP-completeness | |||
04/11/23 | NP-completeness | |||
04/13/23 | NP-completeness | |||
04/18/23 | Review | |||
04/20/23 | Exam 4 | |||
04/25/23 | Monte-Carlo |
As a member of the Georgia Tech community, I am committed to creating a learning environment in which all of my students feel safe and included. Because we are individuals with varying needs, I am reliant on your feedback to achieve this goal. To that end, I invite you to enter into dialogue with me about the things I can stop, start, and continue doing to make my classroom an environment in which every student feels valued and can engage actively in our learning community.