CS5800: Algorithms

Fall 2018

Class Times and Locations:
TF 9:50-11:30PM, Snell Engineering Center 168 (Section 1, Rajaraman)
TF 4:00-5:40PM, Hurtig 024 (Section 2, Vijaykumar)

Office Hours: TBD
Piazza Link

Staff    Description   Textbook   Grading
    Prerequisites      Recitations


Instructors: Rajmohan Rajaraman     Rukmini Vijaykumar

Teaching Assistants:      Rene Adaimi    Kuai Hu     Hamid Jahanjou     Mehraneh Liaee     Chuhan Liu     Rohan Phadke     Priya Singh

Office Hours
Rajmohan: T 12-1PM, W 4-5PM @ 240WVH or by appointment
Rukmini: Fridays, 1-3PM @ 132H Nightingale Hall or by appointment
TA Office Hours TBD

Tentative Course Schedule

Course Description

This is an introductory graduate course in algorithms.   Every computer program can be viewed as an implementation of an algorithm for solving a particular computational problem.  The focus of this course is on learning algorithm design techniques for solving the underlying computational problems.  We will also look at how algorithms translate to programs, but our emphasis will be on the algorithm design and analysis.   In this class, you will


Algorithm Design, by Kleinberg and Tardos, Pearson


There are no formal prerequisites for this class.  Nevertheless, a solid understanding of basic discrete mathematics principles is necessary to do well in the course. 


Grades will be based on problem sets (12%), programming assignments (8%), in-class quizzes (total 15%), 2 midterms (15% each), and final (35%). 



Since this is a large class, and the main focus of the course is problem-solving, we will have weekly recitation sessions in which we will work through the problem sets and related exercises.