Fundamental Algorithms

Informations | News | Homework | Dates

Winter 2012/13, Module IN2157

Instructor Andrey Rybalchenko. Office hours by email appointment.

Prerequisites:

Basic knowledge in Computer Science (IN0001).

Contents:

• Fundamentals: models of computation, complexity measures, Landau notation
• Sorting: insertion-/merge-/heap-/quick-sort
• Searching and trees: binary search, search trees, AVL trees, (2,3)-trees
• Heaps and priority queues
• Graph algorithms: depth first search, breath first search, shortest path problems, minimum spanning trees
• Arithmetic problems: euclidean algorithm, multiplication of integers

Literature:

• K.H. Rosen: Discrete Mathematics And Its Applications.
• Slides of WS 2008/09 PDF
• Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.: Introduction to Algorithms, 2nd Print, MIT Press, 2001
• Robert Sedgewick.: Algorithms, 2nd Print, Pearson Education, Munich, 2002
• Volker Heun: Grundlegende Algorithmen, 2. Auflage, Vieweg-Verlag, 2003

---