1. Monte-Carlo methods

2. van-Emde Boas (vEB) trees

3. Flow networks, push-relabel

4. Parallel algorithms

5. Fibonacci heaps

6. Optimization problem, methods, max/min (f(x))

7. Ant Colony Optimization, Mathematical Formulations

8. Ant Colony Optimization, concepts, introduction

9. Computational Geometry, Line Segments

10. Data Structures, Bags, Queues, Stacks

11. Solving linear equations, LUP decomposition

12. Data Structures, Fibonacci Heaps

13. Introducing Algorithms

14. Q/A: LUP Decomposition, why do we need the P? Why the LU will give us a wrong result?

15. Analysis of algorithms, time and space complexity

16. Randomized algorithms

17. Randomized algorithms, time & space analysis

18. Data Structures, B-Trees, basic operations

19. Data Structures, Fibonacci Heaps, extract operations

20. Data Structures, Fibonacci Heaps, decrease key

21. Data Structures, Disjoint-Sets

22. Flow networks, Ford-Fulkerson's Method

23. String Matching, Finite Automata