Discrete Mathematics

Modulnummer
MN1007
Modulverantwortliche
Hans-Rudolf Metz
Dozenten
  • Bettina Just
  • Hans-Rudolf Metz
  • Kurzbeschreibung
    Introduction to Discrete Mathematics by teaching fundamentals of the topics: logic, sets, functions, combinatorics, relations, graphs, etc.
    Qualifikations- und Lernziele

    Students are familiar with fundamental concepts and methods of Discrete Mathematics as a basis for future courses of their studies. They grasp the significance of Discrete Mathematics for computer science and know examples of specific applications. Students can follow and reason the train of thoughts of lectures logically.

    Lerninhalte
    • logic (propositions, predicates, quantifiers)
    • sets, sets of numbers
    • functions, sequences, sums, series
    • methods of proof, proof by induction
    • combinatorics
    • relations
    • graphs, especially trees
    • boolean algebra
    • factorization, prime numbers
    Moduldauer (Semester)
    1
    Unterrichtssprache
    Deutsch
    Gesamtaufwand
    6 CrP; 180 Stunden, davon etwa 90 Stunden Präsenzzeit.
    Semesterwochenstunden
    6
    Lernformen

    Lecture 4 SWS, exercises 2 SWS

    Geprüfte Leistung

    Examination prerequisite: 2 accepted pieces of homework,

    Examination: Written exam

    Bewertungsstandard
    according to examination regulations (§ 9)
    Häufigkeit des Angebots
    Semesterly
    Literatur
    • G. Teschl, S. Teschl: Mathematik für Informatiker, Band 1,Springer-Verlag
    • A. Chetwynd, P. Diggle: Discrete Mathematics, Butterworth-Heinemann
    • K. H. Rosen: Discrete Mathematics and Its Applications, McGraw-Hill
    • L. Lovász, J. Pelikán, K. Vesztergombi: Discrete Mathematics (deutsche Übersetzung: Diskrete Mathematik),Springer-Verlag
    Voraussetzungen
    None