Algorithm Coding Club (Winter)Module description #40861 / Version 2
- 3 CP
- Portfolio examination
- Ungraded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40861 / #2 |
|---|---|
| Validity | SS 2018 – SS 2019 |
| Available language(s) | English, German |
| Credit points | 3 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Ungraded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351100 FG Algorithmik und Komplexitätstheorie (AKT) |
Contact
| Office | TEL 5-1 |
|---|---|
| Contact person | Thielcke, Christlinde |
| E-mail address | rolf.niedermeier@tu-berlin.de |
| Website | http://www.akt.tu-berlin.de/menue/teaching/ |
Learning outcomes
Main topic: algorithms for graph problems
On successful completion, students know:
- advantages and disadvantages of different data structures to represent graphs, in particular adjacency lists and matrices.
- implementations of fundamental graph algorithms, in particular various variations of breadth-first search.
- approaches to solve showcase problems like computing paths, finding separators, and identifying important subgraphs.
Furthermore, students will be able to:
- model given tasks with graphs in a mathematical and formal way.
- design efficient algorithms to solve the given computational graph problems with adequate data structures and basic algorithms.
- work in teams.
- successfully participate in programming contests such as the ACM Programming Contest.
On successful completion, students know:
- advantages and disadvantages of different data structures to represent graphs, in particular adjacency lists and matrices.
- implementations of fundamental graph algorithms, in particular various variations of breadth-first search.
- approaches to solve showcase problems like computing paths, finding separators, and identifying important subgraphs.
Furthermore, students will be able to:
- model given tasks with graphs in a mathematical and formal way.
- design efficient algorithms to solve the given computational graph problems with adequate data structures and basic algorithms.
- work in teams.
- successfully participate in programming contests such as the ACM Programming Contest.
Content
The course
- gives an introduction to modelling problems especially focussing on graphs,
- gives an overview on standard techniques in algorithm design for challenging computational problems on graphs,
- teaches to design and implement algorithms, and
- teaches effective team work.
- gives an introduction to modelling problems especially focussing on graphs,
- gives an overview on standard techniques in algorithm design for challenging computational problems on graphs,
- teaches to design and implement algorithms, and
- teaches effective team work.
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Algorithm Coding Club | Project | Winter and summer semester | – | 2 | ISIS |
Workload and credit points
Algorithm Coding Club (Project)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance in Lectures | 5 | 2 h | 10 h |
| Attendance in programming contests | 5 | 4 h | 20 h |
| Attendance in discussions of solutions | 5 | 2 h | 10 h |
| Preparation for programming contests | 5 | 10 h | 50 h |
| 90 h | |||
The workload of the module adds up to 90 hours. The module therefore comprises 3 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++.
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
| Grading | Ungraded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| (Deliverable assessment) Programming Contest (1) | 20 | practical | 4h |
| (Deliverable assessment) Programming Contest (3) | 20 | practical | 4h |
| (Deliverable assessment) Programming Contest (2) | 20 | practical | 4h |
| (Deliverable assessment) Programming Contest (4) | 20 | practical | 4h |
| (Deliverable assessment) Programming Contest (5) | 20 | practical | 4h |
Exam description
Programming contests: Each contest consists of at least 3 programming task of varying difficulty. The programming tasks need to be solved in teams of three students within a given time limit. Each solved task gives 10 points (at most 20 points per contest). It is automatically checked whether the submitted programs fulfill given specifications within given time limits.
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 40.
Registration procedures
Please register at QISPOS or directly at the examination office.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
available – Slides will be made available during the lecture period: www.isis.tu-berlin.de
Recommended literature
No recommended literature given
Assigned programs
This module is not used in any program.
Miscellaneous
Students of other degrees can participate in this module if there is enough capacity.