Skip to main content

Discrete Mathematics

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.

Prefix:
CS
Course Number:
275
Semester:
Fall 2016
Year:
2017010
Credits:
4.0