Administrivia

Lecture: MWF, 12:00N-12:50 PM, 107 Talbert

• No Lecture: April 16
• Last Day of Classes: April 26
• Exam I: Friday, March 19
• Exam II: Wednesday, April 14
• Final Exam: Thursday, May 6, 11:45-2:45, Knox 109

• M, 3:00 PM - 3:50 PM, 209 Norton
• M, 11:00 AM - 11:50 AM, 250 Park
• Th, 8:00 AM - 8:50 AM, 258 Capen

T.A.: Yang Wang

• Office Hrs.: TBD

• Subscribe to sunyab.cse.531. I will post informaton to this group as appropriate.

Preamble:

• CSE 4/531 is a graduate-level course in Algorithms. Undergraduates will be graded separately from graduate students.

Prerequisites:

1. Calculus I, Calculus II, and a course in Advanced Data Structures.
2. Students should know, and are responsible for, the material in chapters 1-13 of Introduction to Algorithms, by Cormen, Leiserson, and Rivest. In addition, students are also responsible for material on balanced trees (e.g., AVL, Red/Black, B-trees).

Reading Material:

• Algorithms Sequential & Parallel (Second Edition), R. Miller and L. Boxer, Charles River Media, 2005.
• Additional material and citations to relevant material will be made available via this Web site.

Grading Policy:

1. Two comprehensive exams will account for 40% of your grade.
2. Homeworks will account for 10% of your grade.
3. A comprehensive final exam will account for 50% of your grade.

Notes:

• This will be a paper and pencil course. There will be no programming assignments.
• Recitation is required. New and supplementary material will be presented in recitation sections.
• Plagiarism: Any plagiarism will earn you an F in the course. Further, you should be aware that the Department of Computer Science has recently taken a serious stance in such instances and may bring you up on charges of academic dishonesty and attempt to have you expelled from the University.

Disclaimer: I reserve the right to change any part of this tentative syllabus at any time.