Data Structures and Algorithms 2014/15: 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 Sections 1-3, Section 4)
   • In the lecture, I showed an iterative implementation of the Fibonacci function.

   • These are Java implementations of Insertion Sort, Insertion Sort with an inner for loop, and Selection Sort.

2. Complexity and Correctness of Algorithms  (Slides)

3. Divide and Conquer, Recurrences  (Slides, 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.

• A Java implementation of the Fibonacci Function with matrix powering by squaring and Karatsuba multiplication for BigIntegers.

4. Heapsort, Quicksort  (Slides, lecture notes on Heapsort and Quicksort)
   • Hoare's original article on Quicksort in the Computer Journal (accessible from within the UNIBZ network)

   • Paper by Bentley and McIlroy (1993) on designing a sorting function for a C library, based on Quicksort: "Engineering a Sort Function"

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)
   • Red-Black Tree Demonstration by John Franco at U Cincinnati: Build your own tree and see what happens!
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)