EECS 4101/5101
Advanced Data Structures
Lecture Slides
(these are power point files)
INTRODUCTION:
[
Slide 1
] Amortization, Self-Adjustment, Competitiveness.
DICTIONARIES:
[
Slide 2
] Move-to-Front Heuristic on Linear Lists.
[
Slide 3
] Binary Search Trees, Multi-way Search Trees.
[
Slide 4
] B-trees, 2-3-4 Trees.
[
Slide 5
] Red-Black Trees.
[
Slide 6
] Splay Trees.
[
Slide 7
] Augmenting Data Structures.
PRIORITY QUEUES:
[
Slide 8
] Leftist, Skew, Binomial, and Fibonacci Heaps.
DISJOINT SET UNION:
[
Slide 9
] Union-Find.
COMPUTATIONAL GEOMERY:
[
Slide 10
] Overview, Preliminaries, Simple Polygons.
[
Slide 11
] Line Segments Intersections, 2D Linear Programming.
[
Slide 12
]
Polygon Triangulation, Guarding an Art Gallery.
[
Slide 13
] Convex Hull: Algorithms and Applications.
[
Slide 14
] All Nearest Neighbors & Closest Pair.
APPROXIMATION ALGORITHMS:
[
Slide 15
] Approximation Algorithms for NP-hard Optimization Problems.