CS 275 - Discrete Mathematics

[4 Credit Hours]

Topics in discrete math aimed at applications in Computer Science. Fundamental principles: set theory, induction, relations, functions. Boolean algebra. Techniques of counting: permutations, combinations, recurrences, algorithms to generate them. Introduction to graphs and trees.

Prereq: MA 113 and either EGR 102 or CS 115.