CSE 6331 Algorithms
Autumn, 2016.
Intructor:
Anastasios Sidiropoulos.
TA:
Jiaqi Liu.
Time:
Wed Fri, 2:203:40pm.
Location:
140 W 19th, Room 207.
Instructor office hours:
Mon, 12:001:00pm, at Dreese Labs, Room 589
TA office hours:
Tue, 10:0011:00am, at Dreese Labs, Room 778
Information

Grading policy: 20% homework, 25% first midterm, 25% second midterm, 30% final. No late homework will be accepted.

Book: Introduction to Algorithms (3rd edition), by Charles E. Leiserson, Ronald Rivest, Thomas H. Cormen, and Clifford Stein.

Midterm 1: Oct 5, 2016
Study material (the numbering is according to CLRS, 3rd edition): Chapter 3, Chapter 6, Chapter 7, Chapter 12: 12.1, 12.2, 12.3, Chapter 13: 13.1, 13.2, 13.3, Chapter 15: 15.1, 15.2, 15.3, 15.4, Chapter 16: 16.1, 16.2.

Midterm 2: Nov 9, 2016
Study material: Everything from midterm 1, and also Chapter 11: 11.1, 11.2, 11.3, except for the proof of Theorem 11.5, Chapter 17, Chapter 19, Chapter 22: 22.1, 22.2, 22.3.

Final exam: Dec 14, 2016, 12:00pm1:45pm
Study material: Everything from midterms 1 and 2, and also Chapter 22, Chapter 23, Chapter 24: 24.1, 24.2, 24.3, 24.5, Chapter 25, Chapter 26: 26.1, 26.2.
Additional material
The following videos are from the review sessions for CSE 2331 (courtesy of Prof. Wenger).
Lectures

Aug 24, 2016. Lecture 1: Introduction, complexity of algorithms, asymptotic growth of functions.

Aug 26, 2016. Lecture 2: Heapsort.

Aug 31, 2016. Lecture 3: Quicksort.

Sep 2, 2016. Lecture 4: Binary search trees.

Sep 14, 2016. Lecture 5: Dynamic programming I.

Sep 16, 2016. Lecture 6: Dynamic programming II.

Sep 21, 2016. Lecture 7: Greedy algorithms.

Sep 23, 2016. Lecture 8: Redblack trees.

Sep 28, 2016. Lecture 9: Hashing I.

Sep 30, 2016. Lecture 10: Review of midterm study material.

Oct 5, 2016. Midterm 1.

Oct 7, 2016. Lecture 11: Hashing II.

Oct 12, 2016. Lecture 12: Amortized analysis I.

Oct 19, 2016. Lecture 13: Amortized analysis II.

Oct 21, 2016. Lecture 14: Fibonacci heaps I.

Oct 26, 2016. Lecture 15: Fibonacci heaps II.

Oct 28, 2016. Lecture 16: Elementary graph algorithms I: Breadthfirst search.

Nov 2, 2016. Lecture 17: Elementary graph algorithms II: Depthfirst search.

Nov 4, 2016. Lecture 18: Elementary graph algorithms III: Strongly connected components.

Nov 16, 2016. Lecture 19: Minimum spanning trees.

Nov 18, 2016. Lecture 20: Singlesource shortest paths.
Homework