Discrete Mathematics for Computer Science (MATH-135)
This course introduces the foundations of discrete mathematics as they apply to computer science. The topics covered include binary and hexadecimal number systems, sets, logic and truth tables, functions and relations, combinations and permutations, recurrence relations, Boolean algebra, graph theory, matrix operations, and induction. Fall, Summer.
Faculty: Michael J Cullinane
Start/End Date: Jan. 21, 2014 - May 9, 2014
Instructional Method: Lecture-based Learning