Content: Mathematical reasoning and proofs, abstraction. Sets, relations (e.g. equivalence and order relations), functions, combinatorics, (un-)countability, graph theory, number theory, algebra (groups, rings, fields, polynomials, subalgebras, morphisms), logic (propositional and predicate logic, proof calculi).
The primary goals of this course are (1) to introduce the most important concepts of discrete mathematics, (2) to understand and appreciate the role of abstraction and mathematical proofs, and (3) to discuss a number of applications, e.g. in cryptography, coding theory, and algorithm theory.
See course description.
available (in english)
Performance assessment information (valid until the course unit is held again)
Performance assessment as a semester course
In examination block for
Bachelor's Programme in Computational Science and Engineering 2010; Version 01.08.2016 (Examination Block) Bachelor's Programme in Computational Science and Engineering 2012; Version 13.12.2016 (Examination Block) Bachelor's Programme in Computer Science 2008; Version 24.02.2016 (Examination Block)
The performance assessment is offered every session. Repetition possible without re-enrolling for the course unit.
Mode of examination
written 180 minutes
Keine. In der Prüfung wird eine Zusammenfassung des Skriptes verteilt, die schon zu Beginn der Vorlesung bekannt gegeben wird.
If the course unit is part of an examination block, the credits are allocated for the successful completion of the whole block. This information can be updated until the beginning of the semester; information on the examination timetable is binding.
No public learning materials available.
Only public learning materials are listed.
No information on groups available.
There are no additional restrictions for the registration.