250024 VO Discrete mathematics (2008W)
Labels
Details
Language: German
Examination dates
Lecturers
Classes (iCal) - next class is marked with N
- Monday 06.10. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 13.10. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 20.10. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 27.10. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 03.11. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 10.11. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 17.11. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 24.11. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 01.12. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 15.12. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 12.01. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 19.01. 11:00 - 13:00 Hörsaal 2 Eduard Suess, 2A122 1.OG UZA II Geo-Zentrum
- Monday 26.01. 11:00 - 13: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 250025. 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 250025. 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 250025. 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 250025. 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.
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 250025. There, the comprehension of the notions and methods presented in the course will be practised and deepened by solving instructive exercises.