MA4011 - Big data architectures, datavisualisation and challenge

You are here:

MA4011 - Big data architectures, datavisualisation and challenge

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.

This course is part of the programme

In brief

ECTS credits : cf Teaching Unit

Contact(s)

Pascal LEZAUD

Phone : +33 5 62 25 95 51

Email : pascal.lezaud @ enac.fr