Algorithms and Data Structures

Literature

Online Tutorials and Manuals

  1. Algorithms: Foundations

    1. Literature and On-line Material
    2. Introduction to Algorithms
    3. Basic Definitions
    4. Algorithmic Complexity Measures
    5. Growth of Functions and Efficency
      Exercise: Complexity
    6. Boolean Logic (by C. Herta) (local backup)
      Exercise: Logic
    7. Pseudo Code
    8. An Example: Insertion Sort
    9. Divide and Conquer
    10. NP-Complete Problems
    11. Recurrences
    12. Randomized Algorithms

  2. Abstract Data Types -- Data Structures (slides)

    1. Introduction
    2. Arrays
    3. Lists (slides)
    4. (Priority) Queues
    5. Stacks
    6. Hash Tables (slides)
    7. Trees
      Exercise: Abstract Data Types

  3. Sorting Algorithms (slides)

    1. Sorting
    2. Insertion Sort
    3. Bubble Sort
    4. Quick Sort
      Exercise: Quick Sort
    5. Radix Sort
    6. Heap Sort

  4. Clustering

    1. Hierarchical Clustering (by Michael Stelzer 2004)
      Exercise: k-means clustering

  5. Hidden Markov Models (HMMs)

    1. HMM Teil1 (MC): Intro and Forward Algorithm (by Jana Reinemund 2004) ,
    2. HMM Teil2: Viterbi. (by Heike Stier 2004)
      Exercise: HMM Source: FensterAlgo.java

  6. Huffman Coding

    1. Huffman Coding (by Axel Fischer 2004)

  7. Formal Languages

    1. Finiter Automat (FSM), Regular Expressions (by Ingrid Bader 2004)