IA5565 - Big data architectures and data visualisation

Objectives

General objective:

Be able to compute time and space complexities of sequential algorithms.
Be able to apply the technique of dynamic programming to optimize recursive formulations.
Be able to compare algorithms and choose the most suitable.

Form of assessment

Total assessment hours: 1.5