Discrete StructuresModule description #40024 / Version 13
- 6 CP
- Written exam
- Graded
- Summer semester
- English
| Module / Version | #40024 / #13 |
|---|---|
| Validity | Since Summer semester 2026 |
| Available language(s) | German |
| Credit points | 6 |
| Person responsible for the module | Kreutzer, Stephan |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34352200 FG Logik und Semantik (LaS) |
Contact
| Office | EN 23 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | akt-secretary@lists.tu-berlin.de |
| Website | https://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen |
Learning outcomes
Graduates of this module can understand and assess problems in discrete mathematics. They can develop simple proofs using, for example, induction and the pigeonhole principle. They are familiar with discrete structures (e.g., set systems and graphs) and their application in computer science. In particular, this includes various combinatorial counting methods and elementary basic concepts of number theory, including public-key cryptography, which is relevant in the context of IT security.
Furthermore, they have a solid basic knowledge of graph theory. In particular, they understand various classical graph problems such as matching and graph coloring. They can exploit the properties of special graph classes (e.g., bipartite and planar graphs) to solve graph problems.
Furthermore, they have a solid basic knowledge of graph theory. In particular, they understand various classical graph problems such as matching and graph coloring. They can exploit the properties of special graph classes (e.g., bipartite and planar graphs) to solve graph problems.
Content
- Combinatorics
- Number Theory (with applications to Cryptography)
- Graph Theorie
- Algebraic Structures
- Number Theory (with applications to Cryptography)
- Graph Theorie
- Algebraic Structures
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Diskrete Strukturen (Tutorial)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 4 h | 60 h |
| 90 h | |||
Diskrete Strukturen (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Pre/post processing | 15 | 4 h | 60 h |
| 90 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
- Lecture
- Supervised exercise groups
- Independent work on exercises in small groups
- Supervised exercise groups
- Independent work on exercises in small groups
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Knowledge from the modules “Formal Languages and Automata,” “Algorithms and Data Structures,” and “Linear Algebra I” is useful.
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | German |
| Duration/Extent | 120 min |
Exam description
According to §47 (2) AllgStuPO the grade will be calculated applying grading key 1 of Fakultät IV, it may however be altered in favour of the students.
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Die Einteilung der Tutorien erfolgt über MOSES in der ersten Vorlesungswoche. Die Prüfungsanmeldung erfolgt über QISPOS. Die An- und Abmeldefristen werden über ISIS bekannt gegeben. Die Lehrmaterialien werden über ISIS bereitgestellt.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Folien werden über www.isis.tu-berlin.de verfügbar sein
Recommended literature
- Angelika Steger: Diskrete Strukturen, Band 1, 2. Auflage, Springer 2007
- James L. Hein: Discrete Structures, Logic, and Computability, James and Bartlett Publishers 2010
- Rod Haggarty: Diskrete Mathematik für Informatiker, Pearson 2004
- Susanna S. Epp: Discrete Mathematics with Applications, Brooks Cole, 2003
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Computer Science Computer Science (B. Sc.) - StuPO 2015 | SS 2026 | Pflichtbereich |
| WS 2026/27 | Pflichtbereich › Grundlagen der Mathematik | |
| MINTgruen pre-study orientation program MINTgruen pre-study orientation program (OS.) - Studienaufbau MINTgrün | SS 2026 | Wahlpflicht MINT › Module aus der Informatik |
| WS 2026/27 | Wahlpflicht MINT › Module aus der Informatik | |
| Natural Sciences in the Information Society StuPO 2018 | SS 2026 | Wahlpflichtbereich › Informatik › Grundlagenmodule |
| WS 2026/27 | Wahlpflichtbereich › Informatik › Grundlagenmodule | |
| Natural Sciences in the Information Society Natural Sciences in the Information Society (B. Sc.) - StuPO 2025 | SS 2026 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Grundlagenmodule Informatik |
| WS 2026/27 | Wahlpflichtbereich › Wahlpflichtbereich Informatik › Grundlagenmodule Informatik |
Miscellaneous
Not specified