CSE 548: Analysis of Algorithms

Spring 2012 Tuesdays and Thursdays 10:30 – 11:50 am Academic Building 326

Instructor : Seon Joo Kim seonjookim@sunykorea.ac.kr Academic Building 422

Use Blackboard page for course documents and information.

Overview
This course is a graduate level introduction to the design and analysis of algorithms.
Some of the topics that will be covered in the class include : graphs, greedy algorithms, recurssions, dynamic programming,
approximation algorithms, randomized algorithms, and network flow.
Expect lots of discussion and problem solving during the class.

Is CSE548 For You?
I expect the students to have taken an undergraduate level algorithm class and know what the following words mean -
big-O notion, running time, sorting, worst-case analysis.

Grading
Class participation (15%), 6 written homeworks (20%), midterm exam (30%), final exam (35%).

Textbook
Required: Algorithm design, by Jon Kleinberg, Eva Tardos, Addison-Wesley, 2005.

Lightly recommended :
- Lecture notes by Jeff Erickson (http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/) .
- Introduction to algorithms, by T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, The MIT Press, 2nd edition, 2001.