> Formation > Cursus ingénieur
To develop some basic notions, for instance in the design of graph algorithms.
To introduce some technics for solving hard problems.
1. advanced divide and conquer algorithms. Worst case and average cost analysis.
2. Advanced graph algorithms
3. solving hard problems: dynamic programming and branch-and-bound
4. Introduction to distributed algorithms.
basics in algorithms
Give kind of exam for session 1 and session 2: written, allowed documents or not, oral, practical work, reports, plan, vivas
N1 = (0.7*E1 + 0.3*P)
N2 = max (N1,0.7*O2 + 0.3*P)
The course exists in the following branches:
Course ID : 4MM1AA
Course language(s):
The course is attached to the following structures:
You can find this course among all other courses.
Cormen, Leiserson, Stein, Rivest, Introduction à l'algorithmique, Dunod
Kozen, Lessons on algorithms
Date of update January 15, 2017
Nos sites
e-Services
