IA4008 - Big data conferences

IA4008 - Big data conferences

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.

Hours

  • Lectures : 10
This course is part of the programme

In brief

ECTS credits : cf Teaching Unit

Number of hours 10

Contact(s)

Pascal LEZAUD

Phone : +33 5 62 25 95 51

Email : pascal.lezaud @ enac.fr