Warning! The directory is not yet complete and will be amended until the beginning of the term.
250012 VO Discrete mathematics (2018S)
Labels
Exams on 28.06.2018 and 28.09.2018 take place form 09:00-11:00 am
Details
Language: German
Examination dates
- Thursday 28.06.2018 08:00 - 11:15 Hörsaal 5 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Friday 28.09.2018 08:00 - 11:15 Hörsaal 4 Oskar-Morgenstern-Platz 1 Erdgeschoß
- Friday 25.01.2019 08:00 - 11:15 Hörsaal 12 Oskar-Morgenstern-Platz 1 2.Stock
Lecturers
Classes (iCal) - next class is marked with N
- Tuesday 06.03. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 13.03. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 20.03. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 10.04. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 17.04. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 24.04. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 08.05. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 15.05. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 29.05. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 05.06. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 12.06. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 19.06. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
- Tuesday 26.06. 09:45 - 11:15 Hörsaal 13 Oskar-Morgenstern-Platz 1 2.Stock
Information
Aims, contents and method of the course
Assessment and permitted materials
Written exam
Minimum requirements and assessment criteria
The mastery of basic concepts of Discrete Mathematics. A rigorous presentation of answers and solutions during the written exam is required.
Examination topics
For the exam you will have to know all the course (definitions, examples, technical constructions, theorems, proofs, motivations, contexts, etc). In addition, the mastery of the subject will be checked by considering appropriate examples and by posing suitable problems.
Reading list
Christian Krattenthaler and Markus Fulmek, "Diskrete Mathematik", lecture notes SS2017.
Martin Aigner, "Diskrete Mathematik", Vieweg, 1993.
Peter Cameron, "Combinatorics", Cambridge Unviersity Press, 1994.
Martin Aigner, "Diskrete Mathematik", Vieweg, 1993.
Peter Cameron, "Combinatorics", Cambridge Unviersity Press, 1994.
Association in the course directory
DMA; UFMA09, UFMAMA02
Last modified: Mo 07.09.2020 15:40
Choice problems, permutations, partitions.
Calculus of generating functions, solving recurrences.
The principle of inclusion-exclusion.
Searching and Sorting,
Graphs and networks.
An essential complement to the course are the exercises (= Übungen zu Diskrete Mathematik). There, the comprehension of the notions and methods presented in the
course will be practised and deepened by solving instructive exercises.