Administrivia

Lecture: TTh, 12:30-1:50, 205 NSM

Recitation (choose one):

• T, 5:00-5:50, 263 Capen
• F, 10:00-10:50, 218 Norton

T.A.: C.-W. Lee

• TA, Office Hrs.: Thurs, 3-4p, Fri, 11-12; Location: Trailer A

Newsgroups:

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

Preamble:

• CS531 is a graduate-level course in Analysis of Algorithms that is required of all graduate students in the Department of Computer Science.

Prerequisites:

1. 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:

• Material is currently available at Makin' Copies (in the UB Commons). Additional material will become available throughout the semester. (It is the policy of the department to distribute handouts of significant size in this manner and not to make them available in an on-line fashion.)
• Parallel Algorithms for Regular Architectures: Meshes and Pyramids, Miller and Stout, The MIT Press, 1996. This will serve as the primary text for the course and is available in the bookstore.
• Introduction to Algorithms, Cormen, Leiserson, and Rivest, McGraw-Hill, 1990. This will serve as a reference text. I anticipate that the majority of students enrolled in the class will have access to this text through previous course(s).
• Parallel Computation: Models and Methods, Akl, Prentice Hall, 1997. This is a new book with a good presentation of the introductory material we use in the course.
• Other material will be made available via this Web site.

Grading Policy:

1. Midterm exam will account for 40% of your grade.
2. Final exam will account for 60% of your grade.
3. Homeworks will be graded, but will not factor into your final course grade.

Notes:

• Only those assignments submitted before the beginning of class on the day they are due will be graded.
• 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.