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

Competitive AlgorithmicsModule description #40932 / Version 3

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27).
Module / Version#40932 / #3
ValiditySummer semester 2022 – Winter semester 2022/23
Available language(s)German
Credit points6
Person responsible for the moduleNichterlein, André
GradingUngraded
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

OfficeTEL 5-1
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://www.akt.tu-berlin.de/menue/teaching/

Learning outcomes

On successful completion, students know:
- advantages and disadvantages of different data structures
- efficiency aspects of different programming languages
- how to implement suitable algorithms and data structures using suitable software development tools
- how to check software efficiently and effectively using self-created randomized black box tests

Furthermore, students will be able to:
- work in teams
- successfully participate in programming contests such as the ACM Programming Contest.

Content

The course
- teaches the abstraction of given problems
- teaches to design algorithms to solve these abstract problems
- teaches to implement these algorithms
- teaches to check the implementation efficiently and effectively using randomized black box tests

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Programmierpraktikum: Wettbewerbsorientierte AlgorithmikInternship0434 L 245 Winter and summer semester[de]4 ISIS

Workload and credit points

Programmierpraktikum: Wettbewerbsorientierte Algorithmik (Internship)

Workload descriptionMultiplierHoursTotal
Attendance154 h60 h
Pre/post processing158 h120 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

The course has the following 3-week pattern: First, a lecture provides the necessary algorithmic basics. Second, a programming contest takes place where the students solve programming tasks in small teams (2-3 students). Third, solutions and problems occurred in the implementation will be discussed.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

Basic knowledge in algorithms, data structures, and programming is helpful.
We do not recommend participation without basic programming skills in Java or C++.

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

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

Test elements

NamePoints/WeightCategoryDuration/Extent
Programmierwettbewerb 114practical4 Stunden
Programmierwettbewerb 214practical4 Stunden
Programmierwettbewerb 314practical4 Stunden
Programmierwettbewerb 414practical4 Stunden
Hausaufgabe 111practical5 Seiten
Hausaufgabe 211practical5 Seiten
Hausaufgabe 311practical5 Seiten
Hausaufgabe 411practical5 Seiten

Exam description

4 contests 14 PP each; 4 homeworks 11 PP each; passed (ungraded) if more than 50 PP

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

The maximum capacity of participants is 30.

Registration procedures

Please register at QISPOS or at the examination office.

Recommended reading, lecture notes

Lecture notes

unavailable

Electronic lecture notes

unavailable

Recommended literature

No recommended literature given

Assigned programs

This module is not used in any program.

Miscellaneous

Not specified