|
|
Root number
|
11479 |
|
Semester
|
HS2021 |
|
Type of course
|
Lecture |
|
Allocation to subject
|
Computer Science |
|
Type of exam
|
Written exam |
| Title |
Discrete Mathematics |
| Description |
This course introduces students to discrete mathematics. Notions and methods are presented that are important for a deeper understanding of computer science. Discrete mathematics is the part of mathematics that deals with finite and countably infinite structures. The course starts with important concepts like sets, relations, and functions. Then core concepts of algebra and number theory are introduced, which are also relevant for coding and cryptography. Graphs and the foundations of logic are discussed, in particular, propositional logic and first-order logic. This course is crucial as a preparation for studying further topics in theoretical computer science, such as computability, complexity, efficiency, and randomized algorithms. |
|
ILIAS-Link (Learning resource for course)
|
No registration/deregistration in CTS (Admission in ILIAS possible).
ILIAS
|
|
Link to another web site
|
|
| Lecturers |
Prof. Dr.
Christian Cachin, Institute of Computer Science ✉
|
|
ECTS
|
5 |
|
Recognition as optional course possible
|
No |
|
Grading
|
1 to 6 |
| |
| Dates |
Tuesday 10:15-13:00 Weekly
|
|
Wednesday 12/1/2022 10:15-12:00
|
|
Tuesday 15/3/2022 13:15-18:00
|
| |
| Rooms |
Hörsaal 1 001, Engehalde, E8
|
|
Hörsaal A006, Exakte Wissenschaften, ExWi
|
| |
| Students please consult the detailed view for complete information on dates, rooms and planned podcasts. |
User:
Öffentlicher Bereich
Support