CompSci 102, Spring 2012
Discrete Math for Computer Science

Course Description:

Mathematical notations, logic, and proof; linear and matrix algebra; graphs, digraphs, trees, representations, and algorithms; counting, permutations, combinations, discrete probability, Markov models; advanced topics from algebraic structures, geometric structures, combinatorial optimization, number theory.

There is a recitation associated with this course. The required work in this course includes homework assignments.

Required Background:

Prerequisites: Mathematics 31 and 32; Computer Science 6.

Course Announcements