Lectures
Homework
Course Calendar
Piazza

Course Information
Course Description
This is a first course in the design and analysis of
algorithms. The main focus is on techniques for constructing correct
and efficient algorithms, and on tools to reason about them. Design
paradigms include greed, divideandconquer, dynamic programming,
reduction to network flow, and the use of randomness. A second focus
point is computational intractability. NPcomplete problems are
covered, as well as ways to deal with them.
The course forms a foundation for all areas of computer science. The
particular computational problems discussed have applications in
artificial intelligence, computational biology, compiler construction,
hardware and network protocols, and optimization.
Textbook
Jon Kleinberg and Eva Tardos, Algorithm Design, AddisonWesley, 2005.
References
S. Dasgupta, C. Papadimitriou, and U. Vazirani,
Algorithms, 1st edition, 2008.
T. Cormen, C. Leiserson, R. Rivest, and C. Stein,
Introduction to Algorithms, 2nd edition, 2001.
K. Rosen, Discrete Mathematics and its Applications,
4th edition, 2003.
Prerequisites
CS 240 (Discrete Mathematics), and CS 367 (Data Structures).
Exams
All exams are closed book and closed notes. However, you will be allowed to bring a "cheatsheet".
 Midterm (30%). W 3/16 7:15 p.m.  9:15 p.m.
 Final (30%). F 5/13 12:25 p.m.  2:25 p.m.
Grading Policy
 Point distribution. The points distribution for final
grades is as follows: homework (40%  8x5; the lowest
homework score will be dropped), midterm (30%), final (30%).
 Homeworks. There will be 9 homeworks in all, roughly one every week. Homework release dates and due dates are posted on the course calendar. We will drop the lowest homework score from
consideration when tallying each student's final score.
 Collaboration policy. Homework must be done and submitted in
pairs (or, in an exceptional situation by the instructor's permission, in groups of three). You may not consult any material other than your lecture notes
and the course text or reference books. In particular, the use of
materials (such as homework solutions) from previous versions of the
course or from the Internet is considered plagiarism and will warrant
strict action in accordance with university policy.
 Lateness policy. Each homework is due at the beginning of
the lecture on the due date. No extensions will be given on the due
date. However, we will drop each student's lowest homework score
from consideration.
 Extra credit questions and discussion on Piazza. Some of
the homeworks will contain extra credit questions. These questions
have no points associated with them. However, we will keep a record of
how many questions each student (or team) solves correctly. At the end
of the semester, your performance on these questions may help your
letter grade if your total score is close to the boundary between two
grades. Your participation on the online discussion site Piazza may similarly help
your letter grade.
Staff + contact info
(Note: all TA office hours are held in CS 1304. Shuchi's office hours are held in CS 4373.)
Instructor for section 2:
Shuchi Chawla

CS 4373; x0027; shuchi (AT) cs (DOT) wisc (DOT) edu

Teaching Assistants:


Ben Miller
 bmiller (AT) cs (DOT) wisc (DOT) edu

Rex Fernando
 rex (AT) cs (DOT) wisc (DOT) edu

Kevin Kowalski
 nargle (AT) cs (DOT) wisc (DOT) edu

