104.272 Discrete Mathematics
This course is in all assigned curricula part of the STEOP.
This course is in at least 1 assigned curriculum part of the STEOP.

2020W, UE, 2.5h, 5.0EC


  • Semester hours: 2.5
  • Credits: 5.0
  • Type: UE Exercise
  • Format: Distance Learning

Learning outcomes

After successful completion of the course, students are able to carry out graph theoretical proofs, to describe and apply important graph theoretical concepts and algorithms, to apply advanced methods in combinatorics, number theory and algebra as well as to solve exercises in applications of the theory of finite fields.

Subject of course

Higher Combinatorics, Graph Theory, Number Theory, Polynomials over Finite Fields

Teaching methods

Homework exercises and presentations of the solutions via zoom.

Mode of examination


Additional information

The exercise sheets will be posted on TUWEL system.

Solved exercises must be uploaded and indicated by ticking the appropriate boxes in the TUWEL system.

Zoom exercise sessions take place Thursdays from 17:00 to 18:30 on the following dates:

15.10., 22.10., 29.10., 5.11., 12.11., 19.11., 26.11., 3.12., 10.12., 17.12., 14.01., 21.01.






Examination modalities

Exercise Sheets. Presentation of solutions via Zoom.

Course registration

Begin End Deregistration end
01.10.2020 20:40 18.10.2020 23:59 12.10.2020 23:59

Registration modalities:

Please enroll in one of the two groups!

Group Registration

GroupRegistration FromTo
G101.10.2020 20:4012.10.2020 23:59
G201.10.2020 20:4012.10.2020 23:59


Study CodeSemesterPrecon.Info
066 931 Logic and Computation 1. Semester
066 938 Computer Engineering 1. Semester


No lecture notes are available.

Previous knowledge

Basic knowledge in algebra, discrete mathematics and analysis as it is taught in the courses of the first year in the bachelor studies.


  • Attendance Required!