CS 323: Design and Analysis of Algorithms
Instructor: Hoeteck Wee (hoeteck at cs·qc·cuny·edu)
Office Hours: Mon 4-5 PM in SB A346, or by appointment
Lectures: Mon, Wed 5-6.15 PM in SB B141
Homework | Lecture Schedule | Course Description & Policies
- Course Announcements
- Dec 2: You may view your graded midterm 3 by going to Xiuyi at the
CS Office starting tomorrow afternoon.
- Dec 1: Homework 9 (last and final homework) is
posted on the Homeworks page. This homework is
"optional". I will drop the lowest two of your
grades for Homeworks 1 through 9 in computing the
Homework component of your final grade.
- Nov 30: Solutions to review problems are here.
- Nov 25: Mid-term next Wed Dec 2:
- greedy, dynamic programming, network flows.
- algorithms you should know: Dijkstra's, Bellman-Ford, Ford-Fulkerson
- review: Homeworks 6, 7 and 8, practice midterm 2, actual midterm 2
- additional practice: Textbook Chapter 7, Ex 5, Ex 20(a)
- two double-sided cheat-sheets
- Nov 17: There will be an in-class mid-term in 2 weeks, on Dec 2 (Wed). As mentioned during Lecture 1, there will be no rescheduling for mid-terms.
- Nov 16: Homework 8 is up,
except for the code. The last question is intended to help you revise for the next and final mid-term.
- Nov 11: Here is an implementation
of the longest subsequence algorithm presented in the Mon lecture.
- Nov 9: Added a written question to Homework 7.
[ archived ]
|