Administrivia

Lecture: TTh, 12:30-1:50, 218 Norton

Recitation (choose one):

• T, 3:30-4:20, 90 Alumni (Smelkov)
• W, 2-2:50, 17 Norton (Gopal)
• F, 12-12:50, 209 Norton (Smelkov)

T.A.s:

• Pavel R Smelkov, Office Hrs.: Mondays, 10-11; Wednesdays, 2:30-3:30; Bell 335
• Vinodh Gopal, Office Hrs.: Wednesdays, 11-1, Trailer B

Newsgroups:

• Please subscribe to sunyab.cs.531.

Preamble:

1. CS531 is a graduate-level course in Analysis of Algorithms that is required of all graduate students in the Department of Computer Science.
2. CS431 is an undergraduate-level course in Algorithms that serves as an elective for undergraduate students at the University at Buffalo.

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:

• 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.
• Miscellaneous handouts that will be distributed during the semester. Most of these handouts will appear via this Web site.

Grading Policy:

1. Midterm exam will account for 25% of your grade.
2. Final exam will account for 40% of your grade.
3. Homeworks will account for 35% of your grade.
4. If you pass both the Exam Portion and the Non-exam Portion of the course, then your course grade will be the (weighted) average of these two letter grades. If you fail either portion of the course, you will receive an F in the course.
5. Graduate students will be graded separately and on a different scale from undergraduate students.

Assignments must be submitted before the beginning of class on the day they are due.

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, be it on homeworks/programs or exams, 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.