Week 
Topics 
Reference 
Assignment 
14 
12/5: NP completeness and algorithms for NPC
problems. 12/3: NP completeness 
Chapter 34 Lecture notes 

13 
11/21: Polynomialtime reduction and NP
completeness 11/19: Concept of NP 
Chapter 34 Lecture notes 
HW8. Due 12/5. 
12 
11/14: FFT 11/12: Exam 2 
Chapter 30 Lecture notes (focus on the FFT part) 
HW7. Due 11/21. Note: you only have one week for this assignment. 
11 
11/7: Shortest path. 11/5: MST 
Chapters 23 and 24. Lecture notes 

10 
10/29: Graph traversal: BFS and DFS 10/31: Application of DFS. MST. 
Chapters 22 and 23. Lecture notes 
HW6. Due 11/5. Note: you only have one week
for this assignment. 
9 
10/24: Dynamic programming and BFS 10/22: Dynamic programming 
Chapters 15 and 22 Lecture notes 

8 
10/17: Dynamic programming. 10/15: Greedy algorithm. Dynamic programming. 
Chapters 15 and 16. Lecture Notes 
HW5. Due 10/29. 
7 
10/10: No class. 10/8: Exam 1 (I will travel and my graduate student will monitor the exam) 

6 
10/3: Greedy algorithms. 10/1: Lower bound, counting sort and introduction to greedy algorithms. 
Chapters 8, 16. Lecture Notes 
HW4. Due 10/15. 
5 
9/26: Selection, Heapsort. 9/24: Quicksort. Selection and median. 
Chapters 7, 9, 6. Lecture Notes 

4 
9/19:
Probabilistic analysis. Quicksort. 9/17: Divide and conquer. Introduction to probability and computation. 
Chapters 5 and 7. Lecture Notes 
HW3. Due 9/26. 
3 
9/12: Design and analysis of
divide and conquer algorithm 9/10: Divide and conquer; the Master theorem 
Chapter 4. Lecture Notes 

2 
9/5: Common running time.
Introduction to divide and conquer. 9/3: Asymptotic notations. 
Chapters 3 and 4. Lecture notes. Note: this is from fall 2012 course. The topics covered are similar. 
HW2. Due 9/17. 
1 
8/29: Basics of analysis of algorithm. Insertion sort.
BigO notation. 8/27: Basic concepts of algorithms. Stable matching problem: a motivating example. 
Chapters 1, 2, and 3.1. Appendix A, B and C. A book chapter on stable matching (PDF). Lecture notes 
HW1. Due 9/5 in class if in hard copy. I recommend to submit in PDF in HuskyCT. 