|
Root number
|
11479 |
Semester
|
HS2024 |
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 by introducing some foundations of logic, in particular, propositional logic and first-order logic. Subsequently, important concepts like sets, relations, and functions are discussed. Some core principles of algebra and number theory are introduced, which are also relevant for coding and cryptography. Finally graph-theoretic notions are discussed. This course is crucial as a preparation for studying further topics in theoretical computer science, such as computability, complexity, efficiency, data structures, and 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 14:15-17:00 Weekly
|
|
Tuesday 14/1/2025 10:00-12:00
|
|
Rooms |
Hörsaal 1 001, Engehalde, E8
|
|
Students please consult the detailed view for complete information on dates, rooms and planned podcasts. |