It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms ... divide and conquer algorithm that has wide applications in data analysis. FFT ...

dynamic programming, network flows, reductions, and randomized algorithms. Important themes that will be developed in the course include the algorithmic abstraction-design-analysis process and ...

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

The course includes models of computation, programming language paradigms, programming language design, algorithm analysis, processes, threads, synchronisation and parallel programming. The fourth ...