Data Structures and Algorithms 2014/15: Lectures

This page contains links to

The links are organized according to the topics of the lectures

  1. Organisation, Algorithms, Recursion, Sorting  (Slides Sections 1-3, Section 4)

  2. Complexity and Correctness of Algorithms  (Slides)

  3. Divide and Conquer, Recurrences  (Slides, lecture notes on Divide and Conquer Principles and the Master Theorem)

  4. Heapsort, Quicksort  (Slides, lecture notes on Heapsort and Quicksort)

  5. Dynamic Data Structures, Abstract Data Types  (slides, lecture notes)

  6. Binary Search Trees, Red-Black Trees  (slides, lecture notes on Binary Search Trees and Red-black Trees)

  7. Hashing  (slides, lecture notes on Hashing Principles and Open Addressing)
  8. Graphs: Principles and Graph Traversal  (slides, lecture notes on Graphs: Breadth First, Depth First, Topological Sorting)

BACK Back to the course homepage