CSE 431/531: Algorithm Analysis and Design (Spring 2021)
Course Information
Time: MoWeFr 9:10am~10:00am
Location: Due to the coronavirus pandemic, all lectures will be online.
Credits: 3
Please sign up for the course on Piazza.
Instructor
Shi Li
Email: [first name][last name initial][at][buffalo][dot][edu]
Homepage: http://www.cse.buffalo.edu/~shil/
TAs
| Name | Office Hours | |
|---|---|---|
| Xiangyu Guo | xiangyug[at] | |
| Alesandro Baccarini | [at] |
Overview
Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study of optimization. This course provides an introduction to algorithm design through a survey of the common algorithm design paradigms of greedy optimization, divide and conquer, dynamic programming, and linear programming, and the NP-completeness theory.
Textbook
There is no required text book for the class, but it is recommended that you have one of the following books:
- Jon Kleinberg and Eva Tardos Algorithm Design. 1st Edition, 2005, Pearson.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein Introduction To Algorithms 3rd Edition, 2009, MIT Press.
Grading
Your final grade will be computed as follows:
- Theory Homeworks: 40% = 8% × (5 theory homeworks)
- Programming Problems: 20% = 10% × (2 Programming Problems)
- Final Exam: 40%.
Policies
- Late policy You have one late credit. If you use the credit, you can submit a theory or programming homework 3 days late. No other late submissions will be accepted.
- Collaboration policy For homework problems, you are allowed to discuss with classmates. However, it is highly recommended that you first think about each problem for enough time before the discussion. You must write your solutions by yourself, in your own words. You need to write down the names of the students you collaborated with. For the programming problems, you must implement the algorithms by yourself.
- You can not copy codes, homework and exam problem solutions from other students and external resources. Per departmental policy of academic integrity violations, if we determined that you committed an academic integrity violation, you will get an "F" for the course, and the case will be reported to the department and the university and recorded in their databases.
Slides
NA stands for "no animation".
- Introduction, Introduction-NA (last updated: 08/29/21 20:06)
- GraphBasics, GraphBasics-NA (last updated: 08/29/21 20:06)
- Greedy, Greedy-NA (last updated: 08/29/21 20:06) GreedyRecitation
- DivideAndConquer, DivideAndConquer-NA (last updated: 08/29/21 20:06) DivideAndConquerRecitation
- DynamicProgramming, DynamicProgramming-NA (last updated: 08/29/21 20:06) DynamicProgrammingRecitation
- GraphAlgorithms, GraphAlgorithms-NA (last updated: 08/29/21 20:06)
- NPC, NPC-NA (last updated: 08/29/21 20:06)
Syllabus & Tentative Schedule
| Week | Date | Topic | Contents | Other Notes |
|---|---|---|---|---|
| 1 | Feb 1 | Introduction | syllabus asymptotic notations (KT 2.2) common running times (KT 2.4) |
|
| Feb 3 | ||||
| Feb 5 | ||||
| 2 | Feb 8 | |||
| Feb 10 | Graph Basics | graph basics (KT 3.1) connectivity and traversal (KT 3.2, 3.4) topological order (KT 3.6) |
||
| Feb 12 | ||||
| 3 | Feb 15 | HW1 Posted | ||
| Feb 17 | Greedy Algorithms | interval scheduling (KT 4.1) optimum caching (KT 4.3) Huffman code (KT 4.8) flow time minimization |
||
| Feb 19 | ||||
| 4 | Feb 22 | |||
| Feb 24 | HW1 Due | |||
| Feb 26 | ||||
| 5 | Mar 1 | |||
| Mar 3 | Recitation | HW2 Posted | ||
| Mar 5 | Divide and Conquer | merge sort and counting inversions (KT 5.1, 5.3) quicksort, median-finder, selection (KT 13.5) polynomial and matrix multiplications (KT 5.5) solving recurrences (KT 5.2) |
||
| 6 | Mar 8 | |||
| Mar 10 | ||||
| Mar 12 | HW2 Due | |||
| 7 | Mar 15 | |||
| Mar 17 | ||||
| Mar 19 | Recitation | HW3 Posted | ||
| 8 | Mar 22 | Dynamic Programming |
weighted interval scheduling (KT 6.1) subset sums and knapsack (KT 6.4) Sequence Alignment (KT 6.6) Increasing Subsequence |
|
| Mar 24 | ||||
| Mar 26 | ||||
| 9 | Mar 29 | Mar 28: HW3 Due | ||
| Mar 31 | ||||
| Apr 2 | ||||
| 10 | Apr 5 | Recitation | ||
| Apr 7 | Graph Algorithms | Kruskal's and Prim's algorithm for MST (KT 4.5, 4.6) Dijkstra's algorithm for shortest path (KT 4.4) shortest path with negative weights and Bellman-Ford (KT 6.8) Floyd-Warshall | HW4 Posted | |
| Apr 9 | ||||
| 11 | Apr 12 | |||
| Apr 14 | ||||
| Apr 16 | HW4 Due | |||
| 12 | Apr 19 | |||
| Apr 21 | Recitation | HW5 Posted | ||
| Apr 23 | NP-Completeness | P, NP, Co-NP, P=NP?, NPC (KT 8.1-8.4) circuit-SAT, 3-SAT (KT 8.5) independent set (KT 8.5) |
||
| 13 | Apr 26 | |||
| Apr 28 | APR 27: Programming Problem 1 Due | |||
| Apr 30 | ||||
| 14 | May 3 | May 2: HW5 Due | ||
| May 5 | HW Solutions and Final Review | |||
| May 7 | ||||
| Wed, May 12 | 8:00am-11:00am: Final Exam | May 11: Programming Problem 2 Due | ||