Stud.IP Uni Oldenburg
University of Oldenburg
07.02.2023 09:30:20
mat950 - Discrete Mathematics (Course overview)
Department of Mathematics 6 KP
Module components Semester courses Wintersemester 2022/2023 Examination
Lecture
  • Limited access 5.01.951 - Vorlesung Diskrete Strukturen Show lecturers
    • Dr. Sandra Stein

    Thursday: 14:15 - 15:45, weekly (from 20/10/22), Location: A11 1-101 (Hörsaal B)
    Friday: 08:15 - 09:45, fortnightly (from 21/10/22), Location: A11 1-101 (Hörsaal B)
    Dates on Friday, 28.10.2022 08:15 - 09:45, Wednesday, 18.01.2023 18:15 - 19:45, Friday, 20.01.2023 08:15 - 09:45, Monday, 23.01.2023 16:15 - 19:45, Wednesday, 25.01.2023, Tuesday, 31.01.2023 18:15 - 19:45, Friday, 03.02.2023 08:15 - 09:45, Tuesday, 07.02.2023 14:00 - 16:00, Wednesday, 08.02.2023 10:00 - 14:00, Thursday, 09.02.2023 - Friday, 10.02.2023 14:00 - 18:00, Tuesday, 14.02.2023 16:00 - 18:00 ...(more)
    Location: A11 1-101 (Hörsaal B), W01 0-015, W32 0-005 (+7 more)

Exercises
Hinweise zum Modul
Reference text
Im Zwei-Fächer Bachelor Informatik ist dieses Modul im Basiscurriculum zu studieren.
Prüfungszeiten
after the end of the lecture period
Module examination
Written exam or oral exam.

Bonus points can be earned.
Skills to be acquired in this module
• Getting to know and to understand the axiomatic structure of mathematics and the importance of mathematical reasoning
• Mastering basic mathematical proof techniques and their logical structure
• Recognizing the relevance of premises in mathematical theorems: Localization of premises within proofs and possible consequences if premises are not met
• Exemplary acquaintance with further mathematical areas and thus expansion of the student's mathematical knowledge
• Getting to know applications
• Integration and crosslinking of the student’s mathematical knowledge by establishing relationships between different mathematical areas
• Learning the essential ideas and methods for discrete structures in mathematics
• Knowledge of the fundamental concepts and methods of graph theory
• Knowledge of the fundamental concepts and methods of algebra and number theory, such as groups, rings, fields, residue class rings, Euclidean algorithm, Chinese remainder theorem, polynomials.
• Knowledge of further concepts and methods for discrete structures, e.g. primality tests, RSA, graph-theoretical algorithms