Discrete Mathematics for Information Technology (MATE134)
This course introduces the fundamental techniques in Discrete Mathematics for the application in information technologies. Topics include sets, relations, functions, Boolean algebra, mathematical induction, recursion, the principle of inclusion-exclusion, the multiplication and addition rules, the pigeonhole principle, the permutations and combinations, graphs, path and circuits, trees, minimum spanning tree algorithms.