Data Structures and Algorithms 2013/14: 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 Part 1, Slides Part 2 by M. Böhlen, lecture notes on Divide and Conquer Principles and the Master Theorem)

  4. Heapsort, Quicksort  (Slides by M. Böhlen, lecture notes on Heapsort and Quicksort)

  5. Dynamic Data Structures, Abstract Data Types  (slides by M. Böhlen and R. Sebastiani, lecture notes)

  6. Binary Search Trees, Red-Black Trees  (slides by M. Böhlen and R. Sebastiani, lecture notes on Binary Search Trees and Red-black Trees)

  7. Hashing  (slides by M. Böhlen and R. Sebastiani, lecture notes on Hashing Principles and Open Addressing)
  8. Graphs: Principles and Graph Traversal  (slides by M. Böhlen and R.Sebastiani, lecture notes on Graphs: Breadth First, Depth First, Topological Sorting)





BACK Back to the course homepage