Complexity analysis, Elementary data structures (Arrays, Linked lists, stacks, queues), Search problems (sequential search, bisection), Sorting (elementary sorts, quicksort, merge sort), trees (characteristics, structure, traversal), string search algorithms, priority queues, heap, graphs (characteristics and structure), graph algorithms (shortest path, spanning tree, connectivity, etc.), scheduling problems, flow problems (maximum flow, minimum cost flow problem, etc.), coupling, dynamic programming.

Temps présentiel : 30 heures

Charge de travail étudiant : 70 heures

Méthode(s) d'évaluation : Examen final, Examen partiel, Travail personnel