ECS 20 – Discrete Mathematics for Computer Science – Fall 2008

Announcements (Last updated: 20 Nov, 1:20 pm)

• Coming up next: probability (Schaum's/Chapter 7), graph theory (Schaum's/Chapter 8), Christmas.

General Information

• Lectures to date - Summary of each lecture, with embedded scribe notes
• Suggested readings to date:
  • Velleman, Chapters 1-2 and 4-5 and 7
  • Schaum's outline (Lipschutz-Lipson), Chapters 1-6.6 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, additional grading notes 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

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