IA5568 - 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
- Lecture : 12h
In brief
ECTS credits : cf Teaching Unit
Number of hours 12
Contact(s)
Places
- Toulouse