CS5800: Algorithms

Fall 2017

Class Times and Locations:
MW 2:50-4:30PM, RI 200 (Section 1, Rajaraman)
M 6:00-9:00PM, SL 035 (Section 2, Beit Aharon)

Office Hours: TBD
                       
                       
Piazza Link

Staff    Description   Textbook   Grading
    Prerequisites      Recitations

Staff

Instructors: Or Beit Aharon   Rajmohan Rajaraman

Teaching Assistants:      Pavel Chernikov    Kuai Hu     Hamid Jahanjou     Rishabh Khandelwal     Ehsan RahimiNasab     

Office Hours

Staff
Monday
Tuesday
Wednesday
Thursday
Friday
Or Beit Aharon
12-2:30pm
132A Nightingale




Rajmohan Rajaraman
11-12pm
240 WVH


9:30-10:30
240 WVH

Pavel Chernikov
10-11am
466B WVH

12-1pm
466B WVH


Kuai Hu



2-4pm
466B WVH

Hamid Jahanjou


6-8pm
266 WVH


Rishabh Khandelwal



9am-12pm
466B WVH
Ehsan RahimiNasab

1-3pm
466B WVH



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

Textbook

Algorithm Design, by Kleinberg and Tardos, Pearson

Prerequisites

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. 

Grading

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

Policies

Recitations

M 4:45-5:45 @ RY 217
M 4:45-5:45 @ WVH 110
W 4:45-5:45 @ RY 217
W 4:45-5:45 @ WVH 110

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.