ICS 6D - Discrete Mathematics for Computer Science - Summer Session II, 2017 (Dillencourt)

This web page is a work in progress. More information will be added incrementally.

  • 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 Assistant
  • Enrollment issues:
  • Prerequisites and assumed background:
  • Grading:
  • Final Exam:
  • Tests:
  • Test return/ GradeScope:
  • Test regrades:
  • Homework:
  • Textbook:
  • Reading Assignments:
  • Sending us 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:
  • Email announcements:
  • Question and answer forum
  • Academic Dishonesty:
  • Class Notes:
  • List of topics and class schedule: Click here.

    Last modified: September 11, 2017