CSE 101, Design and Analysis of Algorithms , Spring, 2013

Prof. Russell Impagliazzo

Department of Computer Science and Engineering
University of California, San Diego
La Jolla, CA 92093-0114

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

Russell's Office Hours: W 1-3:30, F 10-11, CSE 4248 or see notice.


TA Russell (Reas) Quentin (Pleple)
Office Hours M 4-6, Th 3-4 (CSE B240A) Tu 5-7, We 12-1 (CSE 4109)
Discussion W 4-5 (WLH 2205) W 4-5 (PETER 102)

Discussion section is mandatory. Please keep that time free. Practice quizzes are during discussion section.

Announcements:

Russell I. will have a special pre-final office hours Monday, June 10 from 10-1.

Course handouts and assignments

  1. Class Description
  2. First homework, due Tuesday, April 9 see the LaTeX template and PDF preview
  3. First homework answer key
  4. Second homework, due Tuesday, April 16 see the LaTeX template and PDF preview
  5. Third homework, due Tuesday, April 23 see the LaTeX template and PDF preview
  6. Second homework,answer key
  7. Third homework answer key
  8. Fourth homework, due Tuesday, April 30 see the LaTeX template and PDF preview
  9. Fourth homework,answer key
  10. Fifth homework, due Tuesday, May 7 see the LaTeX template and PDF preview
  11. Fifth homework answer key
  12. Homework 6, due THURSDAY, May 16 see the LaTeX template and PDF preview
  13. Sixth homework answer key
  14. Homework 7, due THURSDAY, May 23 see the LaTeX template and PDF preview
  15. Seventh homework answer key
  16. Homework 8, due THURSDAY, June 6 see the LaTeX template and PDF preview
  17. Eighth homework answer key
  18. Sample Quiz 1
  19. Sample Quiz 1 Answers
  20. Practice Quiz 1 Answers
  21. Sample Quiz 2
  22. Sample Quiz 2 answers
  23. Practice Quiz 2 answers
  24. Sample Quiz 3
  25. Sample Quiz 3 answers
  26. Sample Quiz 4
  27. Sample Quiz 4 answers
  28. Practice Quiz 3 answers
  29. Practice Quiz 4 answers
  30. Sample Final
  31. 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:
  1. Graph search (pdf)
  2. Using data structures (pdf)
  3. Dijkstra's shortest path algorithm
  4. Analyzing recursive algorithms
  5. The Master Theorem
  6. Divide and conquer multiplication

Course Topics Study Guides

  1. Leeann Bent's Order Notation Summary Sheet (PDF)
  2. Using Data Structures Summary Sheet (postscript)
  3. Greedy Algorithms
  4. Divide-and-conquer Algorithms