Prof. Russell Impagliazzo

Office: 4248 Computer Science and Engineering Building
Phone: (858) 534-1332; Fax: (858) 534-7029;
Email: russell@cs.ucsd.edu

Russell's Office Hours: Tuesday, Wednesday, 10-11. If not crowded, 4248; or TBA if it gets crowded.

Kirill's 202 Office Hours: MONDAY 2-3 , B260 A

Kirill's joint 200/202 Office Hours: Friday 10-11, B260 A

Announcements: Question 4: NOTE CHANGE: Best time is O(H^2 log n), not O(nH) Office hours during this week and finals week: Kirill: Standard office hours: Friday 10-11, Monday 2-3. Additional office hours: Wednesday 2-3. Russell: Standard office hours: Tuesday 10-11, Wed. 10-11. Additional office hours: Friday 11-12, Monday 1-4 (sign-up). Tuesday 2-5 (sign-up). Sign up times are joint with CSE 200 and will have a sign up sheet outside his office for individual meetings with Russell to discuss the exam.

Neil Jones CSE 202 web page for F02. Has some good lecture notes.
Course Handouts

1. Class Description (Postscript)
2. Class Description (PDF)
3. Divide and Conquer Summary Sheet (postscript)
4. Backtracking Summary Sheet (postscript)
5. Greedy Algorithms Summary Sheet (postscript)
6. Dynamic Programming Algorithms Summary Sheet (postscript)
7. Using Data Structures Summary Sheet (postscript)
8. Calibration homework, (ps)
9. Calibration homework, (pdf)
10. Calibration homework,answer key (ps)
11. Calibration homework, answer key (pdf)
12. Homework 1, due April 24 (ps)
13. Homework 1, due April 24 (pdf)
14. Homework 1, Answer Key (ps)
15. Homework 1, Answer Key (pdf)
16. Homework 2, due May 20 (ps)
17. Homework 2, due May 20 (pdf)
18. Homework 2, Answer Key (ps)
19. Homework 2, Answer Key (pdf)
20. A hint on Homework 2
21. Homework 3, due June 5 (ps)
22. Homework 3, due June 5 (pdf)
23. Homework 3, Answer Key (ps)
24. Homework 3, Answer Key (pdf)
25. Some last minute guidelines for the class project
26. Take home final, due June 12 (ps)
27. Take home final, due June 12 (pdf)
28. Lecture Notes from third lecture
29. Lecture Notes from fifth lecture: rank selection (ps)
30. Lecture Notes from fifth lecture: rank selection (pdf)
31. Lecture Notes on data structures for Dijkstra's algorithm and amortized analysis (ps)
32. Lecture Notes on data structures for Dijkstra's algorithm and amortized analysis (pdf)