CSE 3500:  Algorithms and Complexity
Spring 2011


Instructor: Yufeng Wu

Lecture: Tuesday and Thursday 11:00-12:15 pm, ITE 127.

Office Hour: ITE 235, Tuesday and Thursday 9:30-11:00, Wednesday 9:30-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 really happening:

Week
Topics
References
Assignments
14
4/28: Algorithms for NP complete problems.

4/26: NP completeness proof.

Chapters 34 and 35 (only the vertex cover part).
Slides for the Minesweeper (PDF).
Lecture notes of week 14
Quiz 9 (see HuskyCT).
Due: 5/2
13
4/21: NP completeness proofs

4/19: NP and NP completeness

Chapter 34.

Lecture notes of week 13
HW8    Due: 4/28.
12
4/14: Finish global min-cut and the concept of NP

4/12: Shortest path and graph global min-cut

Chapters 24 and 34. See this book chapter (Sect. 13.2) on graph global min-cut (PDF).
Lecture notes of week 12
HW7    Due: 4/21.
11
4/7: Shortest path

4/5: Minimum spanning tree (MST)
Chapters 23 and 24

Lecture notes of week 11
HW6    Due: 4/14.
Quiz 8 (see
HuskyCT).
Due: 4/11
10
3/31: DFS and its applications

3/29: Exam 2
3/26: Basic graph algorithms (BFS and DFS)

Chapter 22


Lecture notes of week 10
Quiz 7 (see HuskyCT).
Due: 4/4
9
3/24: Dynamic programming (Knapsack and matrix chain multiplication)

3/22: Dynamic programming (longest common subsequences and the coin change problem)

Chapter 15



Lecture notes of week 9
Quiz 6 (see HuskyCT).
Due: 3/26 (11 am)
8
3/17: Dynamic programming: longest increasing subsequence and longest common subsequence problems.

3/15: More greedy algorithms and start of dynamic programming
Chapter 16 and 15.


Lecture notes of week 8
HW5    Due: 3/24.
7
3/3: Greedy algorithms.

3/1: Counting sort and selection. Greedy algorithms.
Section 8.2, 9.2 and 16.1-3.

Lecture notes of week 7
HW4    Due: 3/17
Quiz 5 (see HuskyCT). Due: 3/14
6
2/24: More sorting: heapsort and lower bond. Exam 1.

2/22: Quicksort

Chapters 6 and 7.

Lecture notes of week 6

5
2/17: Probabilistic analysis.

2/15: Algorithm design with divide and conquer

Chapters 4 and 5.

Lecture notes of week 5
HW3    Due: 3/3
Quiz 4 (see HuskyCT). Due: 2/21
4
2/10: Divide and conquer: analysis and algorithm design.

2/8: Common running time and merge sort.

Chapters 3 and 4.


Lecture notes of week 4
HW2    Due: 2/17
Quiz 3 (see HuskyCT). Due: 2/14
3
2/3:  Asymptotic notations

2/1: No class (snow day again)

Chapter 3

Lecture notes of week 3
Quiz 2 (see HuskyCT). Due: 2/7
2
1/27: No class (snow day)

1/25: Basic algorithm analysis and asymptotic notations
Chapter 2 (slides)

Lecture notes of week 2
HW1    Due: 2/1
1
1/20: Basic concepts of algorithms. Stable matching problem: a motivating example.

1/18: No class (snow day)
Chapter 1. Appendix A, B and C.
A book chapter on stable matching (PDF).

Lecture notes of week 1
Quiz 1 (see HuskyCT). Due: 1/24