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

Randomized AlgorithmicsModule description #40667 / Version 6

← Module page Deutsche Fassung
This module description is not valid in the current semester (Winter semester 2026/27). Current version (v8)
Module / Version#40667 / #6
ValiditySummer semester 2022 – Winter semester 2022/23
Available language(s)English
Credit points6
Person responsible for the moduleNichterlein, André
GradingGraded
Exam formatOral exam
Language(s) of instructionEnglish

Affiliation

FacultyFakultät IV
InstituteInstitut für Softwaretechnik und Theoretische Informatik
Academic chair34351100 FG Algorithmik und Komplexitätstheorie (AKT)

Contact

OfficeEN 23
Contact personThielcke, Christlinde
E-mail addresslehre@akt.tu-berlin.de
Websitehttps://www.tu.berlin/akt/studium-lehre/lehrveranstaltungen

Learning outcomes

Participants of this module know fundamental randomized methods for design and analysis of efficient algorithms. They can perform simple probabilistic analyses and are aware of the limitations of randomization.

Content

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
- the probabilistic method
- randomized complexity classes

Module components

Compulsory area

The following courses are mandatory for this module:

CoursesTypeNumberFrequencyLanguageHours per weekCourse catalog
Randomized AlgorithmicsIntegrated course0434 L 236 Irregular[en]4 ISIS

Workload and credit points

Randomized Algorithmics (Integrated course)

Workload descriptionMultiplierHoursTotal
Präsenzzeit154 h60 h
Vor-/Nachbereitung156 h90 h
150 h

Course-independent workload

Workload descriptionMultiplierHoursTotal
Prüfungsvorbereitung130 h30 h
30 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 material is presented in lectures. The lectures are accompanied by tutorials in which distributed work sheets are solved together.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

obligatory: Basic knowledge of algorithm design and analysis

Mandatory requirements for the module examination registration:

This module has no examination requirements.

Completion of the module

GradingGraded
Exam formatOral exam
LanguageEnglish
Duration/Extent30 min

Exam description

Final oral exam determining the grade (MP).

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

This module is not limited to a number of students.

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

  • Michael Mitzenmacher, Eli Upfal: Probability and Computing, Cambridge University Press, 2005.
  • Rajeev Motwani, Prabhakar Raghavon: Randomized Algorithms, Cambridge University Press, 1995.

Assigned programs

This module version is used in the following programs:

Program / program versionSemester(s)Curriculum component
Industrial Engineering and Management
Industrial Engineering and Management (M. Sc.) - StuPO 2015
WS 2022/23Ingenieurwissenschaftliche Studienrichtungen/Engineering Majors › Informations- und Kommunikationssysteme/Information and Communication Systems (IKS) › Informations- und Kommunikationssysteme/Information and Communication Systems (Wahlpflicht/Compulsory-Elective) › Distributed Systems and Networks

Miscellaneous

This course is not offered regularly, you will find detailed information on our website: http://www.akt.tu-berlin.de/menue/teaching/