CSE 202, Spring 2014
Algorithm Design and Analysis

Lecturer: Professor Fan Chung Graham   fan@ucsd.edu
                          TA: Olivia Simpson           osimpson@ucsd.edu
Time & Place: Lectures T Th 12:30 - 1:50pm Peterson Hall 102

Office Hours: Fan Chung Graham, APM 7101 W 2:00-3:00 pm.
                        Olivia Simpson, CSE B240A TuTh 11:00am-12:00pm.

This couses covers two main themes -- basic algorithms and some recent developments on Internet algorithms. Also see the Departmental CSE202 page.
The text book is Algorithm Design by J. Kleinberg and E. Tardos, supplemented by other material included in the book, Algorithms by Dasgupta, Papadimitriou and Vazirani. . Grading: 4 homework sets (20%), 1 midterm (30%) and 1 final (50%)
Homework: All homework assignments should be handed in class (before the lecture starts) at the specified due dates:
              Homework #1 (Tuesday April 15)
              Homework #2 (Tuesday April 29)
              Homework #3 (Tuesday May 20) (Thursday May 22)
              Homework #4 (Tuesday June 3) (Thursday June 5)
      The midterm and final will include problems very similar to those in homework assignments.
      No late homework will be accepted.
      Due to the heavy load for our TA, not all of the homework problems will be graded.
      At least one problem from each set will be randomly chosen for grading.

Note that the exam scores depend on the efficiency of your algorithm. For example, if the best algorithm has running time O(log n) but your algorithm is O(n2), you will only get a very partial score.

Announcement | Homework | Slides |Reading |Sample problems and solutions |Others