Fundamental Algorithms - WS 2003/04

Lecturers:

• Prof. Dr. Christoph Zenger

Audience:

• Students in Computational Science and Engineering (compulsory course, 1st semester, 4 credits)

Lectures:

Time and Place

• Monday: 9-11, MI 02.07.023
• Thursday: 12-13, MI 02.07.023

Contents:

• Fundamentals:
  Models of Computation, Complexity Measures
• Sorting:
  Bubble-Sort, Merge-Sort, Heap-Sort, Quick-Sort, Radix-Sort, Median-Algorithms, Lower Bounds
• Searching:
  Hashing, Search Tress, String Matching
• Graph Algorithms:
  Transitive Closure, Shortest Path Problems, Minimum Spanning Trees
• Artithmetic Problems:
  Euclidean Algorithm, Multiplication of Integers, ...

Tutorials:

As there are no tutorials for the CSE lecture. However, you can find exercises in "Fundamental Algorithms" on last year's website.

Exams:

• Midterm (text exam): Mon, Dec 22, exam as PDF file for download

Literature:

An extensive online script of the winter 2002/2003 lecture is available via CSE's Virtual Teaching Centre.

Recommended textbooks:

• Cormen, Leiserson, Rivest, Stein: Introduction to Algorithms
• Knuth: The Art of Computer Programming (Vol. 1-4, quite extensive)
• Sedgewick: Algorithms
• Shackleford: Computing and Algorithms

Further material:

• Preiss: Data Structures and Algorithms with Object-Oriented Design Patterns in Java, available as a webbook.