250036 VO Discrete mathematics (2010W)
Labels
Details
Language: German
Examination dates
- Friday 28.01.2011
- Monday 28.02.2011
- Friday 01.04.2011
- Monday 02.05.2011
- Thursday 05.05.2011
- Friday 10.06.2011
- Friday 08.07.2011
- Wednesday 13.07.2011
- Friday 26.08.2011
- Friday 02.09.2011
- Monday 12.09.2011
- Friday 30.09.2011
- Monday 13.08.2012
- Wednesday 30.03.2016
Lecturers
Classes (iCal) - next class is marked with N
- Monday 04.10. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 11.10. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 18.10. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 25.10. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 08.11. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 15.11. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 22.11. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 29.11. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 06.12. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 13.12. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 10.01. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 17.01. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 24.01. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 31.01. 13:00 - 15:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
Information
Aims, contents and method of the course
Assessment and permitted materials
Written examination at the end of the semester
Minimum requirements and assessment criteria
This course provides an introduction to the basic notions and tools of
Discrete Mathematics, which belong to the fundamentals for every
mathematician, and which are also ubiquitous in other areas.
The following topics will be treated:Choice problems, permutations, partitions.
Calculus of generating functions, solving recurrences.
The principle of inclusion-exclusion.
Searching and Sorting,
Graphs and networks.This course does not require any special prerequisites.An essential complement to the course is the
Proseminar zu Diskrete Mathematik 250037.
There, the comprehension of the notions and methods presented in the
course will be practised and deepened by solving instructive exercises.
Discrete Mathematics, which belong to the fundamentals for every
mathematician, and which are also ubiquitous in other areas.
The following topics will be treated:Choice problems, permutations, partitions.
Calculus of generating functions, solving recurrences.
The principle of inclusion-exclusion.
Searching and Sorting,
Graphs and networks.This course does not require any special prerequisites.An essential complement to the course is the
Proseminar zu Diskrete Mathematik 250037.
There, the comprehension of the notions and methods presented in the
course will be practised and deepened by solving instructive exercises.
Examination topics
This course provides an introduction to the basic notions and tools of
Discrete Mathematics, which belong to the fundamentals for every
mathematician, and which are also ubiquitous in other areas.
The following topics will be treated:Choice problems, permutations, partitions.
Calculus of generating functions, solving recurrences.
The principle of inclusion-exclusion.
Searching and Sorting,
Graphs and networks.This course does not require any special prerequisites.An essential complement to the course is the
Proseminar zu Diskrete Mathematik 250037.
There, the comprehension of the notions and methods presented in the
course will be practised and deepened by solving instructive exercises.
Discrete Mathematics, which belong to the fundamentals for every
mathematician, and which are also ubiquitous in other areas.
The following topics will be treated:Choice problems, permutations, partitions.
Calculus of generating functions, solving recurrences.
The principle of inclusion-exclusion.
Searching and Sorting,
Graphs and networks.This course does not require any special prerequisites.An essential complement to the course is the
Proseminar zu Diskrete Mathematik 250037.
There, the comprehension of the notions and methods presented in the
course will be practised and deepened by solving instructive exercises.
Reading list
Vorlesungsskriptum "Diskrete Mathematik".
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
DM
Last modified: Th 31.10.2024 00:15
Discrete Mathematics, which belong to the fundamentals for every
mathematician, and which are also ubiquitous in other areas.
The following topics will be treated:Choice problems, permutations, partitions.
Calculus of generating functions, solving recurrences.
The principle of inclusion-exclusion.
Searching and Sorting,
Graphs and networks.This course does not require any special prerequisites.An essential complement to the course is the
Proseminar zu Diskrete Mathematik 250037.
There, the comprehension of the notions and methods presented in the
course will be practised and deepened by solving instructive exercises.