Professional Documents
Culture Documents
AADS Exam Note 2022
AADS Exam Note 2022
FACULTY OF SCIENCE
Contents
1 Max Flow 4
1.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
3 Randomized algorithms 6
3.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
4 Hashing 7
4.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
6 NP-completeness 9
6.1 outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
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
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.
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