Advanced Algorithms (I3341)

This course explores advances in algorithm design, algorithm analysis and data structures. The primary focus is on advanced data structures. Topics include advanced trees structures, disjoint sets, heaps, algorithm design techniques, data structures for strings and linear programming algorithms. Finally, we discuss NP-completeness.

Chapter title File to download
Competitive Programming
Asytmptotic Analysis for recursive functions
Hacks on Bitwise Programming
Disjoint Sets
Algorithm design techniques
Greedy algorithms
Divide and Conquer
Dynamic Programming
Graph - Graph Traversal
Graph - Minimum Spanning Tree
Graph - Single-Source Shortest Paths
Graph - All-Pairs Shortest Paths
Graph - Network Flow
Graph - Special Graphs
Graph - Graph Matching
Mathematics
String Processing
Computational Geometry