UNIVERSITY OF COPENHAGEN

FACULTY OF SCIENCE

Exam Note 2022

Advanced Algorithms & Data Structures

Course Exam Notes

January 24, 2023

Contents

1 Max Flow 4
1.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4

2 Linear programming and optimization 5

2.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5

3 Randomized algorithms 6
3.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

4 Hashing 7
4.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

5 van Emde Boas Trees 8

5.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

6 NP-completeness 9
6.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9

7 Exact exponential algorithms and parameterized complexity 10

7.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

8 Approximation algorithms 11
8.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11

9 Polygon Triangulation 12
9.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12

2
The (2022) curriculum

3
1 Max Flow

1.1 outline

(1) Sketch presentation outline.

(2) Introduction to the topic.

(3) Max-flow example.

(4) Ford-Fulkerson method.

(5) Edmonds-Karp analysis.

4
2 Linear programming and optimization

2.1 outline

5
3 Randomized algorithms

3.1 outline

6
4 Hashing

4.1 outline

(1) Definition → Hash function → Three things → Universal and c-approximately universal →
Strong universal.

(2) Example 1: Hash tables with chaining.

(3) Example 2: Signatures.

(4) Hashing Schemes → Multiply-mod-prime → Multiply-shift → Strong Multiply-shift.

(5) Application 3: Coordinated sampling

7
5 van Emde Boas Trees

5.1 outline

8
6 NP-completeness

6.1 outline

9
7 Exact exponential algorithms and parameterized complexity

7.1 outline

10
8 Approximation algorithms

8.1 outline

11
9 Polygon Triangulation

9.1 outline

12