Sets and propositions: Finite and infinite sets, mathematical induction, propositions. Permutations, combinations, and discrete probability. Relations and functions: binary, equivalence relations, partitions, partial ordering, functions. Graphs: weighted graphs, paths and circuits, shortest paths. Eulerian and Hamiltonian paths. Trees. Abstract algebra: groups, cosets, Lagrange's theorem, Boolean algebra.
Credits:3 ECTS: 6