|
Instructors: Prof. Dr. phil. nat. Marc Fischlin
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: Arrays, lists, binary search trees, B-trees, graph representations, hash tables, heaps
- Algorithms: Sorting algorithms, string matching, traversing, insertion, search and deletion in data structures, shortest path search, minimum spanning trees
- Asymptotic complexity: runtime, Landau notation, classes P and NP, NP-completeness
- Algorithmic strategies, for example: divide-and-conquer, dynamic programming, brute force, greedy, backtracking, metaheuristics
Literature:
Suitable references will be announced in the course. A good introduction is the book "Introduction to Algorithms" (fourth edition, April 2022) by Cormen, Leiserson, Rivest, Stein, The MIT Press. Earlier editions of the book can usually also be used.
Preconditions:
Recommended:
Funktionale und objektorientierte Programmierkonzepte (Functional and object-oriented programming concepts)
|
