ICS 6D - Discrete Mathematics for Computer Science - Fall, 2015 (Dillencourt)

This web page is a work in progress. Information will be added/updated incrementally.

Here are a few direct links to portions of this web page that may be of particular interest:

  • Course description from the UCI Catalog:
    Covers essential tools from discrete mathematics used in computer science with an emphasis on the process of abstracting computational problems and analyzing them mathematically. Topics include: mathematical induction, combinatorics, and recurrence relations.
  • Class meetings:
  • Instructor
  • Teaching Assistants
  • Reader(s):
  • Enrollment issues:
  • Prerequisites and assumed background:
  • Textbook:
  • Grading:
  • Final Exam:
  • Quizzes:
  • Reading Assignments:
  • Homework:
  • Note on email: The Teaching Assistants, the Readers, and I and I will make every effort to answer all course-related email promptly and to give helpful answers. You can help us do this by following these simple guidelines:
  • Course announcements:
  • Question and answer forum
  • Academic Dishonesty:
  • Class Notes:
  • List of topics and class schedule: Click here.

    Last modified: October 7, 2015