Moses - Randomized Algorithms

Display language

Diese Modulbeschreibung gilt nicht im aktuellen Semester.

Die Modulbeschreibung gilt nur für den Zeitraum SS 2017 - WS 2018/19. Die Version für das aktuelle Semester (SoSe 2024) finden Sie hier: Modulbeschreibung des SoSe 2024

Module / Version:
#40667 / #4

Validity:
SS 2017 - WS 2018/19

Default display language:
English

Module title:
Randomized Algorithms

Credits:
6

Responsible person:
Niedermeier, Rolf

Grading:
benotet

Type of exam:
Mündliche Prüfung

Zugehörigkeit

Faculty:
Fakultät IV

Institute:
Institut für Softwaretechnik und Theoretische Informatik

Area of expertise:
34351100 FG Algorithmik und Komplexitätstheorie

Prüfungsausschuss:
No information

Kontakt

Office:
TEL 5-1

Contact person:
Thielcke, Christlinde

E-mail address:
lehre@akt.tu-berlin.de

Website:

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

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

Pflichtteil:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Randomized Algorithms	IV	0434 L 236	k.A.	No information	4

Workload and Credit Points

Randomized Algorithms (IV):

Workload description	Multiplier	Hours	Total
Präsenzzeit	15.0	4.0h	60.0h
Vor-/Nachbereitung	15.0	6.0h	90.0h
			150.0h(~5 LP)

Course-independent workload:

Workload description	Multiplier	Hours	Total
Prüfungsvorbereitung	1.0	30.0h	30.0h
			30.0h(~1 LP)

The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

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 test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Oral exam

Language

English

Duration/Extent

30 min

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

This module is not limited to a number of students.

Registration Procedures

Please register at QISPOS or directly at the examination office.

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

Assigned Degree Programs

Semester:

Zeige auch ausgelaufene Studiengänge und StuPOs

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

	Studiengang / StuPO	StuPOs	Verwendungen	Erste Verwendung	Letzte Verwendung
This module is not used in any degree program.

Students of other degrees can participate in this module without capacity testing.

Miscellaneous

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

Randomized Algorithms