back to search

Efficient Algorithms and Data Structures

IN2003Elective Modules Informatics8 ECTSEnglishwinter semesterDepartment Computer Science
AI-edited module sheet. Based on the TUMonline module description, edited for readability.Original in TUMonline

What it is about

You will learn the fundamentals of analyzing algorithms as well as central data structures and fundamental algorithmic problems. The focus is on runtime and space analysis, various search trees, hashing methods, priority queues, union-find structures, as well as maxflow/mincut and matching algorithms. In the end you will be able to analyze algorithms, assess the efficiency of data structures, and design new solutions for problems.

What you will be able to do

  • Analyze and evaluate the runtime and memory requirements of algorithms
  • Understand how basic data structures work
  • Knowledge of fundamental algorithms (e.g. maxflow, mincut, matching)
  • Independently develop suitable algorithms and data structures for new problems

What the module consists of

  • VorlesungDelivery of the content through lecture and presentation
  • ÜbungWorking on problem sets and discussion; individual feedback through correction

Teaching method

  • Vortrag/PräsentationIntroduction and explanation of the topics
  • Übungsblätter mit anschließender DiskussionDeepening the material through active problem solving and feedback

Dates

LectureEffiziente Algorithmen und Datenstrukturen (IN2003)2 groups to choose from

  • AFri10:00–12:00102, Hörsaal 2, "Interims I" (5620.01.102)
    15× · 16.10.–05.02.
    • 16.10.
    • 23.10.
    • 30.10.
    • 06.11.
    • 13.11.
    • 20.11.
    • 27.11.
    • 04.12.
    • 11.12.
    • 18.12.
    • 08.01.
    • 15.01.
    • 22.01.
    • 29.01.
    • 05.02.
  • BMon10:00–12:00102, Hörsaal 2, "Interims I" (5620.01.102)
    14× · 19.10.–01.02.
    • 19.10.
    • 26.10.
    • 02.11.
    • 09.11.
    • 16.11.
    • 23.11.
    • 30.11.
    • 07.12.
    • 14.12.
    • 21.12.
    • 11.01.
    • 18.01.
    • 25.01.
    • 01.02.

ExerciseÜbungen zu Effiziente Algorithmen und Datenstrukturen (IN2003)5 groups to choose from

  • ATue08:00–10:0000.08.038, Seminarraum (5608.EG.038)
    14× · 20.10.–02.02.
    • 20.10.
    • 27.10.
    • 03.11.
    • 10.11.
    • 17.11.
    • 24.11.
    • 01.12.
    • 08.12.
    • 15.12.
    • 22.12.
    • 12.01.
    • 19.01.
    • 26.01.
    • 02.02.
  • BTue12:00–14:0000.13.008, Seminarraum (5613.EG.008)
    14× · 20.10.–02.02.
    • 20.10.
    • 27.10.
    • 03.11.
    • 10.11.
    • 17.11.
    • 24.11.
    • 01.12.
    • 08.12.
    • 15.12.
    • 22.12.
    • 12.01.
    • 19.01.
    • 26.01.
    • 02.02.
  • CThu08:00–10:0000.13.008, Seminarraum (5613.EG.008)
    13× · 22.10.–04.02.
    • 22.10.
    • 29.10.
    • 05.11.
    • 12.11.
    • 19.11.
    • 26.11.
    • 10.12.
    • 17.12.
    • 07.01.
    • 14.01.
    • 21.01.
    • 28.01.
    • 04.02.
  • DWed08:00–10:0002.07.023, Seminarraum (Inf. 2/5) (5607.02.023)
    14× · 21.10.–03.02.
    • 21.10.
    • 28.10.
    • 04.11.
    • 11.11.
    • 18.11.
    • 25.11.
    • 02.12.
    • 09.12.
    • 16.12.
    • 23.12.
    • 13.01.
    • 20.01.
    • 27.01.
    • 03.02.
  • EWed12:00–14:0003.13.010, Seminarraum (5613.03.010)
    14× · 21.10.–03.02.
    • 21.10.
    • 28.10.
    • 04.11.
    • 11.11.
    • 18.11.
    • 25.11.
    • 02.12.
    • 09.12.
    • 16.12.
    • 23.12.
    • 13.01.
    • 20.01.
    • 27.01.
    • 03.02.

From the current semester, not binding. You attend one of several groups; the timetable automatically suggests the one with the fewest clashes.

Module ratings

No ratings for this module yet.

Rate this module

Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.

Lecture
Tutorial
Exam

Official page in TUMonline · Details are not binding.