back to table of content


INFB  Mathematical Programming CourseINF
Lecturers : Prof. Dr. Rolf Socher   eMail
Term3
Course Classification : Informatics Bachelor, Core elective modules B-INF-ProfilCH4
Language : Deutsch/Englisch Type L E
Type of examination : PL  Credits
Method of evaluation : written examination 90 min 
Requirements : Mathematics I
Mathematics II
Computer Programming I
Computer Programming II
Cross References :  
Previous knowledges :  
Aids and special features : Studien- und Prüfungsleistungen:
Successful completion of exercises.
Course grade consists of grade on course examination and the exercises. 
Teaching aims : The students acquire the following abilities:
 Transforming mathematical methods into algorithms
 To assess algorithms according to the following criteria: correctness, efficiency, numerical stability
 Gain experience in the field of mathematical modelling  
Contents :

 Solving modular equations
 (extended) euclidean algorithm
 Applications in cryptography
 Gauß-Algorithmfor solving linear equations
 Applications in coding theory
 Algorithms of graph theory  

Literature : Sedgewick: Algorithmen in Java, Pearson-Studium 2002.
Cormen, Leiserson, Rivest: Algorithmen – Eine Einführung, Oldenbourg 2004  


back to table of content