CSE 431/531: Algorithm Analysis and Design (Spring 2018)


Please sign up the course on Piazza.

We will have the first in-class exam on Friday, Mar 16!

Course Information

Time: MoWeFr 9:00~9:50am

Location: Talbert 107

Credits: 3


Shi Li

Office: 328 Davis Hall

Email: [first name][last name initial][at][buffalo][dot][edu]

Homepage: http://www.cse.buffalo.edu/~shil/

Office Hours: Mondays and Wednesdays, 11:00am-12:00pm, at Davis 328.


Zhongjie Ba (zba2)

Office Hours: Tuesdays 10:00am - 11:00am, at Davis 302 (TA office room).


Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study of optimization. This course provides an introduction to algorithm design through a survey of the common algorithm design paradigms of greedy optimization, divide and conquer, dynamic programming, and linear programming, and the NP-completeness theory.


There is no required text book for the class, but it is recommended that you have one of the following books:


Your final grade will be computed as follows:



HW AssignmentsPost DateDue Date
Homework 12/12/20182/26/2018
Homework 23/3/20183/16/2018
Homework 33/16/20183/30/2018
Homework 44/08/20184/22/2018
Homework 54/23/20185/7/2018
Homework 65/8/20185/15/2018

Tentative Schedule

Exercise Problems will be posted before a recitation lecture. Try to solve them before coming the class.

Academic Integrity

Departmental Policy of Academic Integrity Violations.