|
Instructors: Prof. Dr. phil. nat. Marc Fischlin; Ph.D. Christian Janson
Event type:
Integrated Course
Org-unit: Dept. 20 - Computer Science
Displayed in timetable as:
Algorithms and data structures
Subject:
Crediting for:
Hours per week:
8
Language of instruction:
German
Min. | Max. participants:
- | -
Course Contents:
- data structures: array, list, binary search tree, b-tree, graph representation, hash table, heaps
- algorithms: sorting algorithmgs, string matching, graph traversal, insertion, search, and deletion on particular data structures, shortest path search, minimal spanning trees
- asymptotic complexity
- NP completeness
- algorithmic strategies: Divide-and-Conquer, dynamic programming, brute-force, greedy, backtracking, meta heuristics
Literature:
To be appointed in the lecture.
Preconditions:
Recommended:
Funktionale und objektorientierte Programmierkonzepte
|
