Discrete Mathematics ((4 credit hours))

Catalog description

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. Lecture: 4 credits (60 contact hours).