CS 3511: Algorithms Honors (original) (raw)
| 
| | CS 3511Spring 2023 |
| -------------------------------------------------------------------- | | ------------------ |
General Information:
Instructor: Sahil Singla (s at gatech dot edu)
TAs: Akash Vemulapalli, Sera Biju, William Beard, and Tejas Pradeep
**Meeting time:**Wednesday and Friday, 3.30pm to 4.45pm, Klaus 2443
Course Information Sheet: Link
Piazza: Link
Syllabus and Tentative Schedule: Link
Homework: Homeworks will be posted below when they become available. Submit your solutions on Gradescope. Here is a LaTeX template you may use for the homework, and here is a link to Overleaf if you don't want to install LaTeX on your machine.
- HW1 is now available here. Submit by Jan 20.
- HW2 is now available here. Submit by Feb 3.
- HW3 is now available here. Submit by Feb 17.
- HW4 is now available here. Submit by March 29.
- HW5 is now available here. Submit by April 14.
Schedule:
Check the Piazza Resources page for Handwritten Notes.
| Date | Topic | Notes |
|---|---|---|
| Jan 11 | Introduction, Big O, and Sorting | DPV0, DPV2, R1, R2 |
| Divide and Conquer | ||
| Jan 13 | Divide & Conquer, Recurrences, and Median | DPV2, R3, R4, R6 |
| Jan 18 | Number of Inversions, Multiplication of Numbers, Matrices | DPV2, R3 |
| Jan 20 | Multiplication of Polynomials: Fast Fourier Transform | DPV2 |
| Greedy and Graph Algorithms | ||
| Jan 25 | DFS, (2-)Connected components | DPV3, DPV4, R8 |
| Jan 27 | BFS, Shortest path | DPV4, DPV5, R8, R15 |
| Feb 1 | MST, Prim's algorithm, Greedy for Matroids | DPV5, R15, Wikipedia |
| Feb 3 | Greedy for Scheduling and Huffman encoding | DPV5, R14 |
| Feb 8 | Matching in Bipartite Graphs (guest lecture by Jan) | |
| Feb 10 | Matching in General Graphs (guest lecture by Jan) | |
| Feb 15 | Max Flow and Min Cut | DPV7 |
| Dynamic Programming | ||
| Feb 17 | Contiguous Subseq, Increasing Subseq, Indep Set | DPV6, R16 |
| Feb 22 | All-Pair Shortest Paths | DPV6, R18 |
| Feb 24 | Knapsack Problem, FPTAS | DPV6, R16, Chp 8 here |
| March 1 | Markov Decision Process (MDP) | Wikipedia |
| Continuous Optimization | ||
| March 8 | Intro to Linear Programming | DPV7, CMU notes |
| March 10 | Linear Programming Duality | DPV7, CMU notes |
| March 15 | Game Theory | notes on Piazza, DPV7 |
| March 17 | Convex Optimization | notes |
| Hardness | ||
| March 29 | NP Completeness | DPV8, R19, R23 |
| March 31 | NP Reductions | DPV8, R19, R22 |
| April 5 | Approximation Algorithms | DPV9 |
| Randomness | ||
| April 7 | Concentration: Markov and Chebychev | |
| April 12 | Chernoff-Hoeffding, Balls and Bins | |
| April 14 | Randomized Min Cut |
- DPV means “Algorithms” by Dasgupta, Papadimitriou, and Vazirani.
- R means “Algorithms Illuminated: Omnibus Edition” by Roughgarden.