Discrete Mathematics is a relatively new field within Mathematics. Maybe around 100 years.
In Discrete Mathematics, we study combinatorial objects like graphs, partial orders, trees, and partitions.
Those objects come up in many other areas of Mathematics, like topology, algebra, probability theory, number theory, analysis, and algorithms.
Motivated by this an independent field emerged, with its own conferences, journals, and its own theory.
By now, Discrete Mathematics is the fastest growing field of Mathematics.

Content
The content is Discrete Mathematics in the narrow sense.
We will cover the first half of the beautifully written book "Invitation to Discrete Mathematics" by Jiri Matousek and Jaroslav Nesetril.
The book can be found online. So this might be the best way to look into it.

Grading
he grading will consist of 4 components.
Tests (400 points), homework (500 points), in-class assignments (100 points), and reflections (100 points).
So it is possible to get a total of 1100 points.
You get a 10 if you reach at least 1000 points.

Questions
If you are on the waiting list, please be patient.
The support staff monitors the waiting list and allows students, depending on room capacity, study program, and other formal criteria.

Prerequisites
Formally, you only need basic set theory, functions, proofs by induction, and other basic knowledge.
However, we might go through the material that might be too fast for students that have no affinity for formal proofs.

Gain
For students in computer science this course will be very useful as it will increase the general mathematical maturity, which will be useful as well for many other courses.
For Mathematics students this could be a great entry course into the subject.
It will make it easier to follow corresponding master's courses later.
You can also check out the introduction video. https://youtu.be/XUGGdO1nQy0