Efficient Algorithms and their Applications

Short Name
Eff. Algorithmen u.i. Anw
Module Code
CS2353
Module Coordinator
  • Dr. habil. Frank Kammer
Teacher
  • Andrej Sajenko
Short Description

The students are able to choose appropriate algorithms to solve given problems, and if necessary, modify them. They also can determine their resource consumption.

Learning Objectives

The students have a substantial knowledge of advanced algorithms, are able to understand, to implement and to use them reasonable.

They are able to analyze the running time and the space consumption of the algorithms. Moreover, they know techniques to improve their efficiency.

Furthermore, for given applications, they are able to select algorithms from literature, or to find suitable program libraries and to apply them.

The students can structure algorithms and data structures and can understandably present important aspects to an audience.

Contents
  • Analysis of algorithms
  • Data structures (e.g.: union-find, rank-select, choice dictionaries, suffix-trees)
  • Modification of basic algorithms to improve the running time and memory consumption
  • Advanced graph algorithms and their applications (e.g.: dependency graphs, max-flow)
  • Training of oral communication skills in teams and in front of an audience
Duration in Semester
1
Instruction Language
German
Total Effort
6.0 CrP; an estimated 180 hours, of which approximately 60 are spent in class.
Weekly School Hours
4
Method of Instruction

Seminar 2 SWS

Requirements for the awarding of Credit Points

Examination prerequisite: Multiple exercises (Exact number will be given at the start of the module)

Examination: Project with presentation and discussion

Evaluation Standard

according to examination regulations (§ 9)

Availability
Yearly
References
  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Cliffort Stein: Introduction to Algorithms
  • Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft: Data Structures and Algorithms
  • D. Gusfield: Algorithms on Strings, Trees, and Sequences
  • Ravindra K. Ahuja, Thomas L. Magnanti: Network Flows