Administrivia

Lecture: MWF, 1:00-1:50 PM, 215 NSC

• No Lecture: January 16, January 19, February 23, March 9-13
• Last Day of Classes: April 27

• M, 11:00 AM - 11:50 AM, 213 Norton
• W, 11:00 AM - 11:50 AM, 213 Norton
• T, 5:00 PM - 5:50 PM, 112 Baldy

T.A.: Jeffrey Delmerico

• Office Hrs.: M 2:30p - 3:30p and W 2:30 - 3:30p; Location: Room 19 in Commons CSE Research Area

T.A.: Xiang Yu

Office Hrs.: Tu 3:00 - 4:00p and W 3:00 - 4:00p; Location: Room 4 in Commons CSE Research Area

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

Preamble:

• CSE331 is an undergraduate-level course in Algorithms.

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. Midterm exam will account for 40% of your grade: Friday, March 20.
2. Comprehensive final exam will account for 60% 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.