Module CS4000-KP06, CS4000SJ14

Duration

1 Semester

Turnus of offer

each winter semester

Credit points

6

Course of studies, specific fields and terms:

• Master Computer Science 2019, compulsory, Canonical Specialization Data Science and AI
• Master Computer Science 2019, compulsory, Canonical Specialization Bioinformatics and Systems Biology
• Master Entrepreneurship in Digital Technologies 2020, advanced module, specific
• Master Computer Science 2019, basic module, Theoretical computer science
• Master Medical Informatics 2019, optional subject, Theoretical computer science
• Master IT-Security 2019, compulsory, Theoretical computer science
• Master Medical Informatics 2014, basic module, computer science
• Master Entrepreneurship in Digital Technologies 2014, basic module, technology field computer science
• Master Computer Science 2014, optional subject, specialization field IT security and safety
• Master Computer Science 2014, basic module, Theoretical computer science

Classes and lectures:

• Algorithmics (lecture, 2 SWS)
• Algorithmics (exercise, 2 SWS)

Workload:

• 20 hours exam preparation
• 100 hours private studies and exercises
• 60 hours in-classroom work

Contents of teaching:

• complexity analysis of algorithmic problems
• discrete optimization problems, linear programming
• satisfiability and constraint satisfaction problems
• randomized algorithms
• approximation algorithms and heuristics
• algorithms for algebraic problems

Qualification-goals/Competencies:

• The students can model real problems in an algorithmic manner.
• They can apply basic algorithmic techniques with full command.
• They can analyze algorithms, in particular with respect to corrrectness and complexity.
• They can design efficient algorithms for complex problems.

Grading through:

• written exam

Requires:

• Theoretical Computer Science (CS2000-KP08, CS2000)
• Algorithm Design (CS3000-KP04, CS3000)

Responsible for this module:

• Prof. Dr. Rüdiger Reischuk

Teacher:

• Institute for Theoretical Computer Science
• Prof. Dr. Rüdiger Reischuk
• Prof. Dr. rer. nat. Till Tantau
• Prof. Dr. Maciej Liskiewicz

Literature:

• Aho, Hopcroft, Ullman : Design and Analysis of Computer Algorithms Addison Wesley, 1978
• Cormen, Leiserson, Rivest, Stein : Introduction to Algorithms The MIT Press, 2009
• Mitzenmacher, Upfal : Probability and Computing Cambridge University Press, 2005
• Kreher, Stinson : Combinatorial Algorithms CRC Press, 1999
• Williamson, Shmoys : The Design of Approximation Algorithms Cambridge University Press, 2011

Language:

• German and English skills required

Notes:

Last Updated:

06.01.2025