Algorithm Coding Club (Winter)Module description #40861 / Version 1
- 3 CP
- Portfolio examination
- Graded
- Winter and summer semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40861 / #1 |
|---|---|
| Validity | WS 2017/18 – WS 2017/18 |
| Available language(s) | English |
| Credit points | 3 |
| Person responsible for the module | Niedermeier, Rolf |
| Grading | Graded |
| 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
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.
- 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 |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 4 h | 60 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
Wöchentliche praktische Übungen und Diskussion von Lösungsansätzen.
Weekly practical exercises and discussion of approaches to solve the problems.
Weekly practical exercises and discussion of approaches to solve the problems.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Grundkenntnisse zu Algorithmen, Datenstrukturen und Programmierung sind hilfreich.
Basic knowledge in algorithms, data structures, and programming is helpful.
Basic knowledge in algorithms, data structures, and programming is helpful.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| (Ergebnisprüfung/Deliverable assessment) Programmieraufgaben/Programming Tasks | 75 | practical | 5 Abgaben à 15 Punkte |
| (Punktuelle Leistungsabfrage) Schriftlicher Test/Written Test | 25 | written | 60 min |
Exam description
Die Gesamtnote gemäß §47 (2) AllgStuPO wird nach dem Notenschlüssel 2 der Fakultät IV ermittelt; wir behalten uns jedoch vor, ihn zugunsten der Studierenden anzupassen.
Programmieraufgaben: Geprüft wird die Lauf- und Funktionsfähigkeit von Programmen, die innerhalb spezifizierter Zeitlimits vorgegebene Funktionen berechnen sollen.
Schriftlicher Test: Am Ende des Projekts wird die Teilnahme an einem Progammierwettbewerb durch einen 60-minütigen Test simuliert.
According to §47 (2) AllgStuPO the grade will be calculated applying grading key 2 of Fakultät IV, it may however be altered in favour of the students.
Programming Tasks: It is checked whether the submitted programs fulfill given specifications within given time limits.
Written Test: At the end of the term participation in a programming contest is simulated within a 60-minute test.
Programmieraufgaben: Geprüft wird die Lauf- und Funktionsfähigkeit von Programmen, die innerhalb spezifizierter Zeitlimits vorgegebene Funktionen berechnen sollen.
Schriftlicher Test: Am Ende des Projekts wird die Teilnahme an einem Progammierwettbewerb durch einen 60-minütigen Test simuliert.
According to §47 (2) AllgStuPO the grade will be calculated applying grading key 2 of Fakultät IV, it may however be altered in favour of the students.
Programming Tasks: It is checked whether the submitted programs fulfill given specifications within given time limits.
Written Test: At the end of the term participation in a programming contest is simulated within a 60-minute test.
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
Die Anmeldung erfolgt über QISPOS (für BSc Informatik) bzw. direkt beim Prüfungsamt.
Please register at QISPOS or directly at the examination office.
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
Bei ausreichenden Kapazitäten auch als Wahlpflichtmodul in anderen Studiengängen wählbar.