821085727 17S 3SWS VO Fundamentals of Algorithms and Data Structures (IN0007)   Hilfe Logo

LV - Detailansicht

Wichtigste Meldungen anzeigenMeldungsfenster schließen
Allgemeine Angaben
Fundamentals of Algorithms and Data Structures (IN0007) 
Summer semester 2017
... alle LV-Personen
Informatics 16 - Chair of Computer Aided Medical Procedures (Prof. Navab)
(Contact information)
Angaben zur Abhaltung
- 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
see Module description IN0007

Modul IN0001 (esp. Java)
Für die Anmeldung zur Teilnahme müssen Sie sich in TUMonline als Studierende*r identifizieren.
Online information
course documents
e-learning course (moodle)