DM803 - Advanced Data Structures
 
Spring 2022
Kim Skak Larsen

Home Exam

Lectures and Exercises

Due to integration with the platform "itslearning", this page is organized into topics, which are sorted according to the date of the first lecture of the topic and the later exercises are placed under the topic they belong to. Thus, if one looks at all the dates of lectures and exercises, one will not find an ordered list.

The entries are not static - announced material for a lecture may be updated to what was actually covered after the lecture was given. At the end of the course, the lecture and exercises announcements on this page will reflect exactly what was covered.

Date Time Place Event
Introduction. Amortized Analysis. Leftist and Skew Heaps.
2/2 12-14 U157 Lecture
8/2 12-14 U157 Exercises
Skip Lists.
3/2 12-14 U151 Lecture
22/2 12-14 U56 Exercises
Persistent Data Structures.
9/2 10-12 U28A Lecture
8/3 12-14 U155 Exercises
Scapegoat Trees.
23/2 12-14 U53 Lecture
1/3 12-14 U56 Exercises
Disjoint Sets.
2/3 12-14 U53 Lecture
15/3 12-14 U56 Exercises
Disjoint Sets with Backtracking.
9/3 12-14 U51 Lecture
23/3 12-14 U51 Exercises
Cuckoo Hashing.
16/3 12-14 U152 Lecture
29/3 12-14 U56 Exercises
Fibonacci Heaps. Van Emde Boas Trees.
25/3 14-16 U28A Lecture
19/4 12-14 U51 Exercises/Lecture
Splay Trees. Analysis of Red-Black Trees. Hashing by Chaining.
30/3 12-14 U53 Lecture
26/4 12-14 U155 Exercises/Lecture
X- and Y-Fast Tries. On Balanced Search Trees.
20/4 12-14 U56 Lecture
9/5 14-16 U56 Exercises
Level Ancestors.
27/4 12-14 U28 Lecture
Red-Black Trees with Relaxed Balance. More on Data Structures Design.
11/5 12-14 U51 Lecture
17/5 12-14 U153 Exercises
Finishing Up.
18/5 12-14 U8 Lecture

 


   Data protection at SDUDatabeskyttelse på SDU