This website is no longer updated.

As of 1.10.2022, the Faculty of Physics has been merged into the TUM School of Natural Sciences with the website https://www.nat.tum.de/. For more information read Conversion of Websites.

de | en
Login

Fundamentals of Algorithms and Data Structures (IN0007)
Grundlagen: Algorithmen und Datenstrukturen (IN0007)

Course 0821085727 in SS 2021

General Data

Course Type lecture
Semester Weekly Hours 3 SWS
Organisational Unit Informatics 15 - Chair of Computer Graphics and Visualization (Prof. Westermann)
Lecturers Georg Kohl
Nils Thürey
Susanne Weitz
Dates Tue, 14:00–16:00, virtuell
Wed, 13:15–14:15, virtuell
Tue, 14:00–16:00, virtuell
and 2 singular or moved dates

Further Information

Courses are together with exams the building blocks for modules. Please keep in mind that information on the contents, learning outcomes and, especially examination conditions are given on the module level only – see section "Assignment to Modules" above.

additional remarks Note, summer semester 2021: lecture, exercises and exam will take place online. Content: - basics of efficiency and complexity analysis (terms, measures, Landau symbols, machine model) - data structures for sequences (dynamic arrays, lists, stacks, queues, with complexity of operations) - Hashing (hashing with chaining, universal hashing, hashing with probing; optional: perfect hashing, hash-based algorithms, e.g., set intersection) - Sorting (simple methods: InsertionSort, SelectionSort, BubbleSort; analysis of MergeSort, HeapSort, and QuickSort; optional: sorting-based algorithms, e.g., set intersection; lower bound for comparison-based sorting, selection, RadixSort, external sorting) - priority queues (binary heaps, binomial heaps) - search trees (binary search trees, AVL trees, (a,b)-trees) - graph algorithms (graph representation, traversal via DFS/BFS, 2-connected components, strongly connected components, topological sorting, shortest paths, minimum spanning trees, optional: TSP) - optional: data compression (Huffman, Lempel-Ziv) - optional: basic algorithms in pattern matching
Links Course documents
E-Learning course (e. g. Moodle)
TUMonline entry

Equivalent Courses (e. g. in other semesters)

SemesterTitleLecturersDates
SS 2024 Fundamentals of Algorithms and Data Structures (IN0007) Haas, G. Leis, V. Müller, M.
SS 2023 Fundamentals of Algorithms and Data Structures (IN0007) Thürey, N. Winchenbach, R.
Assistants: Franz, E.Kohl, G.
SS 2022 Fundamentals of Algorithms and Data Structures (IN0007) Lasser, T. Tue, 14:00–16:00, MI HS1
Tue, 14:00–16:00, MW 2001
Wed, 13:15–14:15, MW 2001
Wed, 13:15–14:15, MI HS1
SS 2020 Fundamentals of Algorithms and Data Structures (IN0007) Lasser, T. Tue, 14:00–16:00, MI 00.08.038
Wed, 13:15–14:15, MI 00.08.038
and singular or moved dates
SS 2019 Fundamentals of Algorithms and Data Structures (IN0007) Holl, P. Thürey, N. Tue, 14:00–16:00, MW 2001
Tue, 14:00–16:00, MI HS1
Wed, 13:15–14:15, MW 2001
Wed, 13:15–14:15, MI HS1
SS 2018 Fundamentals of Algorithms and Data Structures (IN0007) Lasser, T.
Assistants: Wald, J. 		Tue, 14:00–16:00, Interims I 102
Tue, 14:00–16:00, MW 0001
Wed, 13:15–14:15, MW 0001
Wed, 13:15–14:15, Interims I 101
and singular or moved dates
SS 2017 Fundamentals of Algorithms and Data Structures (IN0007) Lasser, T.
Assistants: Ostler, D. 		Tue, 14:00–16:00, MW 0001
Tue, 14:00–16:00, Interims I 102
Wed, 13:15–14:15, Interims I 101
Wed, 13:15–14:15, MW 0001
SS 2016 Fundamentals of Algorithms and Data Structures (IN0007) Tue, 14:00–16:00, MW 0001
Wed, 13:15–14:15, MW 0001
SS 2015 Fundamentals of Algorithms and Data Structures (IN0007) Tue, 13:45–16:15, MW 0001
SS 2014 Fundamentals of Algorithms and Data Structures (IN0007) Tue, 13:45–16:15, MW 0001
SS 2013 Fundamentals of Algorithms and Data Structures (IN0007)
Top of page