Department of Computer Science and Engineering
University of California, San Diego
La Jolla, CA 920930114
Office: 4248 Computer Science Building
Phone: (858) 5341332; Fax: (858) 5347029;
Email: russell@cs.ucsd.edu
Russell's Office Hours: Monday 12:102, Thursday, 35. CSE 4248
Russell will have no office hours this Thursday, April 17.
TA 
Udbhav Singh 
Yan Yan 
Stefan Schneider 
TA Office Hours 
Stefan: Tuesday, 36, CSE b240 a 
Udbhav: Wed, 10:3011:30 and 13, CSE b260a 
Yan: Friday morning, 1012, CSE 3148 
Discussion 
W 34, rooms A: (last two digits of SID 0133) Leddn Auditorium; B: (3366) York 2622; C: (6700) Warren
Lecture Hall 2001 
Discussion section is mandatory. Please
keep that time free. Practice quizzes are during discussion section.
Announcements:
Russell's office hours will be later this thursday, May 15 (approximately 36).
Course handouts and assignments

Class Description
Note: revised April 2 to include discussion of algorithmic experiments

First homework, due Monday April 7
Note: revised April 2 to fix some mistakes in the intersection question
see the LaTeX template from last year and PDF preview

First homework answer key

Second homework, due Wed. April 16
NOTE: Revised as of Friday, April 11, including extension to Wed.

Second homework answer key

Sample quiz 1

Sample quiz 1 answers

Practice quiz 1 answers

Homework 3, due April 23 Note changed problem 1 sorted > unsorted

Homework 4, due Monday, May 5

Homework 5, due Monday, May 19

Sample quiz 2

Sample quiz 2 answers

Practice quiz 2 answers

Third homework answer key

Fourth homework answer key

Homework 5 answer key

Homework 6, Due June 4

Homework 6 answer key
Includes problem from Quiz 4

Sample quiz 3

Sample quiz 3 answers

Sample quiz 4

Sample quiz 4 answers

Sample Final

Sample Final answers
Lecture notes: Most of these are from Spring, 2004,
written up by Sean O'Rourke
They will be posted as we cover the topics in class.
Currently Available:

Graph search (pdf)

Using data structures (pdf)

Dijkstra's shortest path algorithm

Greedy algorithms 1: Interval scheduling

Analyzing recursive algorithms

The Master Theorem

Divide and conquer multiplication
Course Topics Study Guides

Leeann Bent's Order Notation Summary Sheet (PDF)

Using data structures in algorithms

Proving greedy algorithms optimal
