1. Modulverzeichnis (MTS)
  2. Module
  3. Modulbeschreibung anzeigen

Research Colloquium on Algorithms and Complexity

Display language
To modulepage Generate PDF

#40685 / #3

SS 2015 - SS 2015

English

Research Colloquium on Algorithms and Complexity

3

Niedermeier, Rolf

benotet

Portfolioprüfung

Zugehörigkeit


Fakultät IV

Institut für Softwaretechnik und Theoretische Informatik

34351100 FG Algorithmik und Komplexitätstheorie

No information

Kontakt


TEL 5-1

Thielcke, Christlinde

lehre@akt.tu-berlin.de

http://www.akt.tu-berlin.de/menue/teaching

Learning Outcomes

Participants of this module have learned how to critically read and evaluate scientific papers. They are able to work independently to gain an understanding of current research results and the methods and proofs behind. They can communicate the central ideas behind and discuss the value of the presented findings. They know about the key features of good oral presentations and the preparation of a corresponding handout (5-10 pages).

Content

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.

Module Components

Pflichtteil:

All Courses are mandatory.

Course NameTypeNumberCycleLanguageSWSVZ
Research Colloquium on Algorithms and ComplexitySEM0434 L 230WiSe/SoSeNo information2

Workload and Credit Points

Research Colloquium on Algorithms and Complexity (SEM):

Workload descriptionMultiplierHoursTotal
Präsenzzeit15.02.0h30.0h
Vor-/Nachbereitung15.04.0h60.0h
90.0h(~3 LP)
The Workload of the module sums up to 90.0 Hours. Therefore the module contains 3 Credits.

Description of Teaching and Learning Methods

Classic seminar with conference style talks. Participating students have to write a handout (5-10 pages), where central ideas and methods presented in the talk are summarized.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

a) obligatory: Bachelor in Computer Science, Technical Computer Science, or Mathematics b) desirable: Further knowledge on algorithms and complexity

Mandatory requirements for the module test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Portfolio examination

Type of portfolio examination

No information

Language

English

Test elements

NamePoints/WeightCategorieDuration/Extent
handout30No informationNo information
talk70No informationNo information

Grading scale

No information

Test description (Module completion)

A total of 100 portfolio points can be achieved: - handout: 30 portfolio points - talk: 70 portfolio points In accordance with § 47 (2) AllgStuPO, the final grade will be determined applying the grading key 1 of faculty IV.

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Winter- und Sommersemester.

Maximum Number of Participants

The maximum capacity of students is 12.

Registration Procedures

Please register at QISPOS or directly at the examination office.

Recommended reading, Lecture notes

Lecture notes

Availability:  unavailable

 

Electronical lecture notes

Availability:  unavailable

 

Literature

Recommended literature
Recommended Reading: The participants are asked to research on their own in order to contribute to the seminar.

Assigned Degree Programs


This module is used in the following Degree Programs (new System):

Studiengang / StuPOStuPOsVerwendungenErste VerwendungLetzte Verwendung
This module is not used in any degree program.
Computer Science diploma Technical Computer Science diploma

Miscellaneous

No information