Data Structures and Algorithms 2013/14: 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

Organisation, Algorithms, Recursion, Sorting
(Slides
Sections 13,
Section 4)

Complexity and Correctness of Algorithms
(Slides)

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)

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)

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

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

Binary Search Trees, RedBlack Trees
(slides by M. Böhlen and R. Sebastiani,
lecture notes on
Binary Search Trees and
Redblack Trees)

Hashing
(slides by M. Böhlen and R. Sebastiani,
lecture notes on
Hashing Principles and
Open Addressing)

Graphs: Principles and Graph Traversal
(slides by M. Böhlen and R.Sebastiani,
lecture notes on Graphs: Breadth First, Depth First, Topological Sorting)
Back to the course homepage