Discrete Mathematics

Short Name
Diskrete Mathematik
Module Code
Module Coordinator
  • Prof. Dr. Hans-Rudolf Metz
  • Prof. Dr. Bettina Just
  • Prof. Dr. Hans-Rudolf Metz
Short Description
Introduction to Discrete Mathematics by teaching fundamentals of the topics: logic, sets, functions, combinatorics, relations, graphs, etc.
Learning Objectives

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.

  • 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
Duration in Semester
Instruction Language
Total Effort
6.0 CrP; an estimated 180 hours, of which approximately 90 are spent in class.
Weekly School Hours
Method of Instruction

Lecture 4 SWS, exercises 2 SWS

Requirements for the awarding of Credit Points

Examination prerequisite: 2 accepted pieces of homework,

Examination: Written exam

Evaluation Standard
according to examination regulations (§ 9)
  • 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