CISH-4010

Discrete Mathematics and Computer Theory**

Propositional logic, algebraic structures (groups, permutations, partial orderings, modular arithmetic, graphs directed, connectedness, circuits, flows, finite fields (irreducible polynomials, error correcting codes), algorithms and algorithmic combinatorics, linear recurrence relations, matrix multiplication.

3 credit hours