Algorithmen und Datenstrukturen

Inhalt

Die Veranstaltung befasst sich mit dem Prinzip und der Implementation grundlegender Algorithmen und Datenstrukturen. Dabei werden u.a. Zeichenketten, geometrische Probleme, Graphen, mathematische Algorithmen und NP-Vollständige Probleme betrachtet.

Empfohlene Literatur

• R. Sedgewick, Algorithmen, Addison-Wesley,
  1991/1998

Contents

During the course, there will be presented the principles and the implementation of fundamental algorithms and data structures. There will be treated, among the others, Strings, geometrical Problems, Graphs, mathematical Algorithms and NP-Completeness Problems. 

Suggested Literature

• R. Sedgewick, Algorithms, 1991/1998
• T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein, Introduction to Algorithms, Third Edition (covers way more topics then the lectures but it is a classic)

• Vorlesung: Donnerstag, 11:00 - 12:30 Uhr, SR015, B11 [Wöchentlich]

• Übungen: Freitag, 15:15 - 16:45 Uhr, SR015, B11 [14-tägig]

• Erste Übung: 26.04.19

• Lectures: Thursday 11:00 - 12:30, SR015, B11 [Weekly]
• Exercises: Friday 15:15 - 16:45, SR015, B11 [Fortnightly]
• First Exercise Friday the 26th of April 2019

• Data Structures and Assignment1
• More Sorting and Assignment2
• More Graphs and Assignment3 (with Templates)
• Divide et Impera and Assignment4
• Sorting-Based Geometric Algorithms and Assignment5

(access only from uni-weimar.de subnet, use VPN from outside)

• Data Structures
• Algorithm Complexity
• Hashing
• String Searching
• Graphs
• Space Reduction and Divide & Conquer
• Sorting Based Algorithms
• Mathematical Algorithms
• NP-complete problems