The student gets a clear and well-founded understanding of algorithm design frameworks and techniques. The course introduces advanced data structures, greedy algorithms in graphs, divide and conquer and dynamic programming techniques. The student will also become familiar with the basic theory of computationally hard problems.
- Opettaja
Csaba Raduly-Baka