Discrete Mathematics in Computer Science
Sets. Finite and infinite sets. Countable sets. The
diagonalizatiom
method. The inclusion-exclusion principle. Mathematical induction. Combinations
and permutations. Introduction to format languages and finite automata.
Grammars. Groups, rings and fields. Isomorphisms, automorphisms and
homeomorphisms.
Permutation groups. Relations. The job scheduling problem. Binary relations,
lattices, partially ordered sets. Equivalence relations and partitions.
Introduction to Boolean algebra.