Divide and conquer algrithms, greedy algorithms, dynamic programming, graph algorithms, priority queues, binary search trees, hashing, data compression.

Type of methodology: Combination of lecture and hands-on

Participants receive the certificate of attendance: Yes

Paid training activity for participants: Yes, for all

Participants prerequisite knowledge: Numerical methods (linear algebra, statistics) Domain-specific background knowledge