CSE 3500:  Algorithms and Complexity
Fall 2012


Instructor: Yufeng Wu
Grader: Sajad Mirzaei (mirzaei.sajad@gmail.com)

Lecture: Tuesday and Thursday 3:30--4:45 pm.

Office Hour: ITE 235, Tuesday and Thursday 9:00-12:00, or by appointment.
Note: solutions of homeworks and exams will be posted on HuskyCT.

Anouncements.

Course Description. See the Syllabus.
 

Schedule. Planned schedule is here, but this is what is happening:

Week
Topics
References
Assignments
14
12/6: Algorithms for NP complete problems.

12/4: NP complete problems.

Chapter 34 and notes.

Slides for the Minesweeper (PDF).
Lecture Notes

13
11/29: NP complete problems.

11/27: Reduction and NP complete problems.

Chapter 34.

Lecture Notes
HW8. Due 12/6
You can assume the HAM-CYCLE problem is NP complete (although we have not done it yet).
12
11/15: FFT and concepts of NP.

11/13: Shortest path. FFT.

Chapter 30 and 34.

Lecture Notes
HW7. Due 11/27
11
11/8: Exam 2.

11/6: Shortest path.

Chapter 24

10
11/1: Strongly connected component. Minimum spanning tree.

10/30: Class cancelled due to storm.
Chapter 23.


Lecture Notes

9
10/25: Graph algorithm: DFS.

10/23: Dynamic programming. Graph algorithm: BFS.

Chapter 22.

Lecture Notes
HW6. Due 11/6
8
10/18: No class.

10/16: Dynamic programming

Chapter 15.
HW5. Due 10/25
7
10/11: Dynamic programming

10/9: Greedy algorithm and dynamic programming.
Chapters 15 and 16.

Lecture Notes

6
10/4: Greedy algorithm.

10/2: Exam 1. Make-up class: lower bound, counting sort and greedy algorithm (the coin change problem and the activity selection problem).

Chapters 8, 16.


Lecture Notes
HW4. Due 10/11. 10/10 (2 pm): Fixed a typo.
5
9/27: Selection, Heapsort.

9/25: Quicksort. Selection and median.

Chapters 7, 9, 6.

Lecture Notes

4
9/20: Probabilistic analysis. Quicksort.

9/18: Divideand conquer. Probabilistic analysis.
Chapters 5 and 7.

Lecture Notes
HW3. Due 9/25.
3
9/13: Design of divide and conquer algorithms.

9/11: Divide and conquer; Master Theorem.

Chapter 4.

Lecture Notes

2
9/6: Common running time. Divide and conquer.

9/4: Asymptotic notations.

Chapters 3 and 4.

Lecture Notes
HW2. Due 9/13.
1
8/30: Basic analysis of algorithms. Example problems. Insertion sort. Big-O notation.

8/28: Basic concepts of algorithms. Stable matching problem: a motivating example.
Chapters 1 and 2. Appendix A, B and C.
A book chapter on stable matching (PDF).

Lecture Notes
HW1 (last updated on 8/30, 5 pm). Due 9/4 in class if in hard copy. I recommend to submit in PDF in HuskyCT.