Skip to content
Technische Universität Berlin Deutsch
Course catalog and module transfer system

Algorithms TheoryModule description #40464 / Version 11

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v15)
Module / Version#40464 / #11
ValidityWinter semester 2020/21 – Winter semester 2021/22
Available language(s)German
Credit points6
Person responsible for the moduleNiedermeier, Rolf
GradingGraded
Exam formatPortfolio examination
Language(s) of instructionGerman

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeEN 23
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen

Learning outcomes

On successful completion, students will have deepened knowledge about algorithmic methods and can design and mathematically analyze (with corresponding proof methods) efficient 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.

Presented topics of algorithm design include in particular:
- greedy algorithms for scheduling problems,
- divide & conquer for fast Fourier transformation,
- dynamic programming for longest common subsequence,
- network flow (preflow push algorithm),
- algorithmic approaches (with provable efficiency or solution properties) to solve NP-hard problems (approximation and fixed-parameter algorithms).

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Grundlagen der AlgorithmikLecture Summer semester–2 ISIS
Grundlagen der AlgorithmikTutorial Summer semester–2 ISIS

Workload and credit points

Grundlagen der Algorithmik (Lecture)

Workload descriptionMultiplierHoursTotal
Präsenzzeit152 h30 h
Vor-/Nachbereitung153 h45 h
75 h

Grundlagen der Algorithmik (Tutorial)

Workload descriptionMultiplierHoursTotal
Präsenzzeit152 h30 h
Vor-/Nachbereitung153 h45 h
75 h

Course-independent workload

Workload descriptionMultiplierHoursTotal
Prüfungsvorbereitung130 h30 h
30 h

The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.

Description of teaching and learning methods

The content of the course is given in a lecture. Weekly exercise sheets are discussed interactively in tutorials to consolidate and apply the lecture content.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic knowledge on algorithms, data structures, and discrete structures.
Successful completion of "Discrete Structures" and "Algorithms and Data Structures" is helpful.

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatPortfolio examination
Type of portfolio examination100 points in total
LanguageGerman

Test elements

NamePoints/WeightCategoryDuration/Extent
(Ergebnisprüfung) Hausaufgabe25writtenmax. 10 pages
(Punktuelle Leistungsabfrage) Schriftlicher Test (1)25written30 min
(Punktuelle Leistungsabfrage) Schriftlicher Test (2)50written80 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

Computer science bachelor students with QISPOS-account register via QISPOS.
All other students register at the examination office.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

available – Vorlesungsfolien sind unter www.isis.tu-berlin.de verfügbar

Recommended literature

  • Kleinberg, Jon; Tardos, Éva: Algorithm Design, 2006, Pearson/Addison-Wesley

Assigned programs

This module is not used in any program.

Compulsory optional subject in computer science bachelor. If there are sufficient capacities, then the course is available for other degree programs.

Miscellaneous

Not specified