direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Bachelor

Diskrete Strukturen

Beschreibung: (6 LP)

 

Absolventinnen und Absolventen des Moduls sind vertraut im Umgang mit Diskreten Strukturen und kennen deren Eigenschaften und Anwendungen in der Informatik. Schwerpunkte sind

  • Algebraische Strukturen
  • Graphtheorie
  • Kombinatorik
  • Zahlentheorie (mit Anwendungen in Kryptologie)
Veranstaltung
Zeit
Lehrperson
Ort    
Sprache
2 SWS
Vorlesung


Mi 10-12
Prof. Dr. Rolf Niedermeier


H0105


deutsch
2 SWS Tutorien
Vincent Froese, Philipp Zschoche

Organisation:

  • Eine Anmeldung im ISIS ist aus organisatorischen Gründen erforderlich. Bitte beachten Sie, dass diese Anmeldung Sie nicht von der regulären Prüfungsanmeldung befreit.
  • Modulbeschreibung (PDF)

Grundlagen der Algorithmik

Beschreibung: (6 LP)

 

Absolventinnen und Absolventen des Moduls besitzen vertiefte Kenntnisse algorithmischer Methoden, Befähigung zu Entwurf und Analyse effizienter Algorithmen und Einsicht in Polynomzeitlösbarkeit und deren Ausweitung.

Einzelne Themen sind beispielsweise

  • Techniken des Algorithmenentwurfs, u.A. Greedyalgorithmen, Divide & Conquer, Dynamisches Programmieren

  • Graphalgorithmen, Algorithmen auf Zeichenketten, Datenkompression

  • NP-schwere Probleme und algorithmische Ansätze zu ihrer Lösung

Diese Veranstaltung dient als Basis für weiterführende Spezialvorlesungen im Masterstudium. Die Veranstaltung besteht aus einem Vorlesungs- und einem Übungsteil.

Veranstaltung
Zeit
Lehrperson
Ort    
Sprache
2 SWS
Vorlesung
Mi 8-10


Prof. Dr. Rolf Niedermeier


EB301


deutsch
2 SWS Tutorien
Matthias Bentert

Organisation:

  • Eine Anmeldung im ISIS ist aus organisatorischen Gründen erforderlich. Bitte beachten Sie, dass diese Anmeldung Sie nicht von der regulären Prüfungsanmeldung befreit.
  • Diese Veranstaltung ist ein Wahlpflichtmodul für das 5. Semester des Bachelorstudiengangs Informatik im Schwerpunkt Softwaretechnik und des Bachelorstudiengangs Technische Informatik im Schwerpunkt Informatik.
  • Modulbeschreibung (PDF)

To top

Algorithm Coding Club

Description: (3 CP)

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. 

This course provides a basic preparation for participation in programming contests, e.g. the International Collegiate Programming Contest (ICPC).

 

Event
Time
Lecturer
Location   
Language
2 SWS
Project


Fr 12-14
Dr. André Nichterlein, Matthias Bentert, Philipp Zschoche
TEL 206li /
Tel 512


english

Organization:

  • A registration with ISIS is necessary. Please note that registration with the Prüfungsamt is still mandatory.
  • The first lecture on Friday (20th April) is in the room Tel 512.
  • The default language is english. If all participants prefer german, the course can be held in german.
  • Module description (PDF)

Master

Algorithmic Research in Teams

Description: (9 CP)

Participants of this module know how to approach concrete problems in algorithmic research. They can present in written and oral form their research findings in a concise and understandable manner. They are able to judge and classify current research results as well as their own findings.

The research project addresses recent selected research publications. Typically, the research topics will feature questions in algorithmic research, e.g., data clustering, computational biology, data mining, graph algorithms with applications. The project will contain the following parts of algorithmic research:

  • Reading and understanding of previous research contributions.
  • Identification of open questions and potential improvements.
  • Active participation in the research process together with other participants and the advisors.
  • Development of technical writing skills in English.
  • Submitting a small paper for publication in an international venue.

The participants will work in groups of size two to four in close cooperation with the advisors.

Event
Time
Lecturer
Location
Language
6 SWS Project
Fr 14-18
and
individual agreement
Prof. Dr. Rolf Niedermeier, Dr. Robert Bredereck, Dr. André Nichterlein, Vincent Froese, Matthias Bentert, Philipp Zschoche
TEL 512
TEL 506
english

Organisation:

  • Registration at ISIS is necessary for organizational reasons. Please note that this registration does not relieve you from your regular module registration.
  • The first kick-off meeting with the presentation of the topics is Friday, 20.04.18, in room Tel 512 from 14-18.

Module description (PDF)

To top

Current Research in Algorithms and Complexity

Description: (3 CP)

The seminar uses recent publications in scientific conferences and journals, focussing on algorithms and complexity. The current topic will be "Algorithms for Fair Allocations".

Event
Time
Lecturer
Location
Language
2 SWS
Seminar
by arrangement
Dr. Robert Bredereck
TEL 512
german/english

Organization:

  • A registration within the ISIS is necessary. Please note that registration at the Prüfungsamt is still mandatory.
  • The topics will be presented on Wednesday, 18.04.2018, at 16:15 in TEL 512.
  • Note that the seminar will take place as a block course.

Module description (PDF)

Randomized Algorithms

Description:  (6 CP)

Introduction into the mathematical and algorithmic foundations of algorithm, design and analysis using the resource “random bits”.

Particular topics are:

  • randomized algorithms for graph problems and geometric problems
  • probabilistic method
  • limits of randomized algorithms
Event
Time
Lecturer
Location
Language
4 SWS
Lecture/Tutorial
Mo 10-12
Wed 8-10
Dr. André Nichterlein, Vincent Froese
TEL 512
english/deutsch

Organization:

  • A registration within the ISIS is necessary. Please note that registration at the Prüfungsamt is still mandatory.
  • The default language is english. If all participants prefer german, the course can be held in german.
  • Module description (PDF)

To top

Parameterized Algorithmics

Description: (6 CP)

 

Graduates of this module

  • know the approach of parameterized complexity analysis for solving NP-hard computational problems,
  • are able to design and analyze parameterized algorithms, and

  • can use complexity-theoretic methods to determine the limits of parameterized algorithmics.

Particular topics include:

  • algorithms for exactly solving NP-hard optimization problems by exploiting important problem parameters such as solution size

  • NP-hard computational problems on graphs and networks and on strings

  • algorithmic techniques such as preprocessing by data reduction, depth-bounded search trees, color coding, iterative compression, tree decomposition of graphs

Event
Time
Lecturer
Location
Language
4 SWS
Lecture + Tutorial
Tue 8-10
Wed 10-12
Dr. Robert Bredereck
TEL 512
german/english

Organization:

To top

Für Interessierte

(Bachelor, Master, Externe)

Research Colloquium on Algorithms and Complexity

Description: (3 CP)

 

In this seminar recent research of our group and special invited guests is presented. The main topics are parameterized algorithmics and complexity. The seminar is an excellent opportunity for advanced students to get in touch with current topics in our research field.

Students that participate in the seminar and also present a current publication in algorithmic research can receive 3 ECTS credit points.

Event
Zeit
Lecturer
Speaker
Location
Language
2 SWS
Colloquium
Thu 16-18
Prof. Dr. Rolf Niedermeier
Guests,
PhD students,
students
TEL 512
german/english

Zusatzinformationen / Extras