Work Note 1, DM803, fall 2016
Lecture September 5
-
Introduction and prerequisites.
-
Amortized Analysis [CLRS09]
-
Leftist Heaps [T83].
-
Skew Heaps [W95].
Lecture September 8 [Changed to Sept. 9]
Announcements
-
The general requirements for this course are introductory courses
in algorithms and data structures and discrete mathematics.
The specific requirements for this course include at least the following:
-
Search Trees (red-black trees)
-
Priority Queues (binary heap)
-
Disjoint Sets (Galler-Fischer representation)
-
Asymptotic Notation
-
General Methods in Time and Space Analysis
Review this material as soon as possibly.
-
Material covered in lectures will in general be distributed in class.
The major exception to this are references to [CLRS09]
(see the discussion of literature below).
You may come by my office at any time before the first lecture
to pick up material (photocopies) for the first lectures.
They will also be available in class.
-
I will maintain a
list of used (distributed) material.
There you can continuously see where you find information
about the various topics and verify that you have all the material.
Last modified: Tue Sep 6 09:52:20 CEST 2016
Kim Skak Larsen
(kslarsen@imada.sdu.dk)