Students understand and master statements and their contexts; they master sets and relations; they master basic axiometry in the fields of real and complex numbers; they understand the Basics of modular arithmetic; they master the elementary counting problems of combinatorics; they understand the Basics of graph theory.

None

The course includes the following main topics:

• Propositional logic and predicate logic (propositions and propositional forms, propositional-logical connections, implications and equivalences, Boolean algebra),
• Sets (concept of sets and elementary sets, set operations and calculation rules, set products),
• Relations (concept of relations and equivalence relations, properties),
• Functions (concept of functions and elementary properties),
• Number sets (from natural to complex numbers), number theory (modular arithmetic, check digits, Euclid's algorithm), combinatorics (basic counting models).

The following basic literature will be used in the course:

• Teschl, G., Teschl, S., Mathematics for Computer Scientists, Vol. 1, Springer, 2006; Schubert, M., Mathematics for Computer Scientists, Springer, 2012;
• Stingl, P., Mathematik für Fachhochschulen, Hanser, 1999;

Lecture, exercises, accompanying tutorial (see study-accompanying Repetitorium LVNr: B2.09100.10.014), accompanying use of computer algebra systems (MATLAB) as well as digital media for self-study.

Final grade comprised of

• Class participation,
• Partial or final examination