MATH 2000 Discrete Methods

Theory of sets. Binary operations. Relations and functions. Theory of graphs: trees, Eulerian and Hamiltonian circuits and combinatorial analysis. Motivation of problems and applications; elementary principles of counting; permutations and combinations; principles of inclusion/exclusion; recurrence relations.

Credits

3

Prerequisite

GEMA 1200