ECS 20 – Discrete Mathematics for Computer Science – Fall 2008

Announcements (Last updated: Dec 12, 6:45 pm)

• Your final is over, yipee! I guess I'll finish with grading on Monday. You're welcome to visit me in office hours next term if you'd like to review it.

  Have a nice holiday season. Do well and do good,
  phil rogaway

General Information

• Lectures to date - Summary of each lecture, with embedded scribe notes
• Final list of suggested readings:
  • Velleman: Chapters 1-2 and 4-5, and 7.
  • Schaum's outline (Lipschutz-Lipson): Chapters 1-6.6, 7, 8, and 12.1-12.5
  • A handout on solving recurrence relations
• Course information sheet - Has important information - you are responsible for everything here.
• Lectures from a prior year - This year may be rather different
• Technical writing for computer scientists - A short and accurate note by a colleague I often work with.
• sample.tex LaTeX file and the sample.pdf it yields (in case you’d like to learn LaTeX).

Problem Sets

• PS 1 and PS 1 Solns (and grading notes by Min-Yu)
• PS 2 and PS 2 Solns (and grading notes by Min-Yu)
• PS 3 and PS 3 Solns (and grading notes, addendum by Min-Yu)
• PS 4 and PS 4 Solns (and grading notes by Min-Yu)
• PS 5 and PS 5 Solns (and grading notes by Min-Yu)
• PS 6 and PS 6 Solns (and grading notes by Min-Yu)
• PS 7 and PS 7 Solns (and grading notes by Min-Yu)
• PS 8 and PS 8 Solns (and grading notes by Min-Yu)
• PS 9 and PS 9 Solns

Exams and Practice Exams

• Quiz 1 and Quiz 1 Solns
• Quiz 2 and Quiz 2 Solns
• Quiz 3 and Quiz 3 Solns
• Practice Midterm (midterm from Spring 2000)
• Midterm (minor typos corrected) and Midterm Solns
• Practice final exam (final from Spring 2000)