Foundations of AlgorithmicsModule description #40464 / Version 4
- 6 CP
- Oral exam
- Graded
- Winter and summer semester
- German
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v15)
| Module / Version | #40464 / #4 |
|---|---|
| Validity | SS 2015 – SS 2015 |
| Available language(s) | German |
| Credit points | 6 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | EN 23 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | lehre@akt.tu-berlin.de |
| Website | https://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen |
Learning outcomes
On successful completion, students will be able to:
- overview standard algorithmic methods
- design and analyze efficient algorithms
- identify polynomial-time solvable problems
- design and analyze algorithms for computationally hard problems
- overview standard algorithmic methods
- design and analyze efficient algorithms
- identify polynomial-time solvable problems
- design and analyze algorithms for computationally hard problems
Content
Fundamental methods in algorithm design and analysis. The course also forms a basis for further specialized lectures in the master program.
Example topics are:
- greedy algorithms, divide & conquer, dynamic programming
- graph algorithms, string algorithms, data compression
- NP-hard problems and algorithmic approaches to solve them
Example topics are:
- greedy algorithms, divide & conquer, dynamic programming
- graph algorithms, string algorithms, data compression
- NP-hard problems and algorithmic approaches to solve them
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Grundlagen der Algorithmik | Integrated course | Winter and summer semester | – | 4 | ISIS |
Workload and credit points
Grundlagen der Algorithmik (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 4 h | 60 h |
| Vor-/Nachbereitung | 15 | 8 h | 120 h |
| 180 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
Die fachlichen Inhalte des Moduls werden in Form einer Vorlesung vermittelt. Die Anwendung und Festigung des Stoffes geschieht durch das regelmäßige Bearbeiten von Aufgabenblättern und die aktive Teilnahme an Übungsgruppen.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basiswissen zu Algorithmen und diskreten Strukturen.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | German |
Exam description
Mündliche Prüfung (MP).
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: Winter and summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Bachelor-Informatik-Studenten mit QISPOS-Kennung melden sich in QISPOS an.
Bachelor-Teilnehmer ohne QISPOS-Kennung, Diplom-Studenten sowie andere Studiengänge melden sich direkt im Prüfungsamt an.
Bachelor-Teilnehmer ohne QISPOS-Kennung, Diplom-Studenten sowie andere Studiengänge melden sich direkt im Prüfungsamt an.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Vorlesungsfolien sind unter www.isis.tu-berlin.de verfügbar
Recommended literature
No recommended literature given
Assigned programs
This module is not used in any program.
Wahlpflicht im Bachelor Informatik im Studienschwerpunkt Softwaretechnik und im Bachelor Technische Informatik im Studienschwerpunkt Informatik.
Bei ausreichenden Kapazitäten auch als Wahlpflichtmodul in anderen Studiengängen wählbar.
Bei ausreichenden Kapazitäten auch als Wahlpflichtmodul in anderen Studiengängen wählbar.
Miscellaneous
Not specified