CSE101 -- Design and Analysis of Algorithms -- Summer 2000


Instructor: Grigore Rosu email: grosu@cs.ucsd.edu
Teaching Assistant: Florin Baboescu email: baboescu@cs.ucsd.edu

General Information

Studentlink Class Page

Announcements

A downloadable file is in final version only when it is itemized by a big brown bullet .
Do not memorize the notions in the lecture notes; understand them!
All the exams (quizes, midterm, final) will be open books.
Lecture Notes 1, July 3; Introduction to Algorithms; Postscript and PDF
Homework 1 - due July 12, 8 am, no exeption; Postscript and PDF
Lecture Notes 2, July 5; Mathematical Foundations; Postscript and PDF
Lecture Notes 3, July 10; Sorting; Postscript and PDF
Lecture Notes 4, July 12; Sorting and Dynamic Programming; Postscript and PDF
Homework 1 - Solutions (average 20.5 / 40); Postscript and PDF
Quiz 1, July 12 - Solutions (average 5.5 / 10); Postscript and PDF
Homework 2 - due July 24, 8 am; Postscript and PDF
Lecture Notes 5, July 17; Dynamic Programming; Postscript and PDF
Sample Midterm with Hints; Postscript and PDF
Lecture Notes 6, July 19; Dynamic Programming; Postscript and PDF
Midterm, July 19 - Solutions (average 9 / 20); Postscript and PDF
Grade Distribution (Approximate grade for average: B,B+)
Lecture Notes 7, July 24; Graph Algorithms; Postscript and PDF
Homework 2 - Solutions; Postscript and PDF
Homework 3 - due August 2, 8 am; Postscript and PDF
Lecture Notes 8, July 26; Graph Algorithms; Postscript and PDF
Quiz 2, July 26 - Solutions (average 7.46 / 10); Postscript and PDF
  • Lecture Notes 9, July 31;
  • Lecture Notes 10, August 2;
  • Homework 3 - Solutions;
  • Final - Solutions