Höhere Algorithmik / Advanced Algorithms

 

Instructor:                 Helmut Alt

                                   Office hour: Tue 14-16, Takustr. 9, Room 123

Teaching Assistant: Nazanin Hadi Niya

Time and Venue:       Lecture:       Mo, Fr 10-12,

                                                       Königin-Luise-Str. 24/26, SR 006

                                    Exercises:   We 8-10 / 14-16, Takustr. 9, SR 055 / 046

 

The language of the course, (including homework submissions) is English, the English name is Advanced Algorithms.

 

Topics

to be treated are, e.g.,

  • general design principles for algorithms
  • data structures
  • graph algorithms
  • network flow
  • string matching
  • linear programming
  • NP-completeness
  • approximation algorithms for hard problems

 

Literature

  • Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms, 4th Ed., The MIT Press 2022.
  • Kleinberg, Tardos: Algorithm Design: Pearson New International Edition, Pearson 2013.

 

Target Group

M.S. and B.S. students aiming for a deeper knowledge of algorithms

 

Knowledge Prerequisite

Basic knowledge about design and analysis of algorithms (e.g. an undergraduate course on this topic).

 

Conditions for Passing

Exam:                       

   50% of the points

 

Regular Attendance:

   85% of the exercise sessions

 

Active attendance:   

   60% of all points for homework exercises including                                 

   25% for each weekly exercise sheet with at most one exception                    

   at least one presentation of a solution  in an exercise session

 

Exercise submissions in groups of two students