Data Structures and Algorithms 2011/12: Lectures

This page contains links to

• the slides underlying the lectures, mainly by Michael Böhlen and Roberto Sebastiani
• the handwritten notes that I use for my presentations at the blackboard
• pointers to other relevant material.

The links are organized according to the topics of the lectures

1. Organisation, Algorithms, Recursion, Sorting  (slides)

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)
   • Section 5.2 on the Master Theorem of the course notes Discrete Math in Computer Science by Ken Bogart and Cliff Stein.

4. Heapsort, Quicksort  (slides by M. Böhlen, lecture notes on Heapsort and Quicksort)
   • Hoare's original article on Quicksort in the Computer Journal (accessible from within the UNIBZ network)

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

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)
   • Red-Black Tree Demonstration by John Franco at U Cincinnati: Build your own tree and see what happens!
7. Hashing  (slides by M. Böhlen and R. Sebastiani, lecture notes on Hashing Principles and Open Addressing)
8. Dynamic Programming  (slides by M. Böhlen, lecture notes on Longest Common Subsequence and Matrix Multiplication Ordering)
9. Graphs: Principles and Graph Traversal  (slides by M. Böhlen and R.Sebastiani, lecture notes on Graphs: Breadth First, Depth First, Topological Sorting)
10. Graph Algorithms: Minimum Spanning Tree and Shortest Path  (slides by M. Böhlen and R.Sebastiani, lecture notes on Minimum Spanning Trees, Shortest Paths)