Advanced algorithm design - 4MM1AA

Informations générales

  • Number of hours

    • Lectures 18.0
    • Projects -
    • Tutorials 18.0
    • Internship -
    • Laboratory works -
    • Written tests -

    ECTS

    ECTS 2.0

Goal(s)

To develop some basic notions, for instance in the design of graph algorithms.
To introduce some technics for solving hard problems.

Responsible(s)

Denis TRYSTRAM

Content(s)

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.

Prerequisites

basics in algorithms

Test

Evaluation : Examen Ecrit (3h)

Resit : Examen oral (exposé, soutenance, etc..) (30 min à 1h)

Give kind of exam for session 1 and session 2: written, allowed documents or not, oral, practical work, reports, plan, vivas

Calendar

The course exists in the following branches:

  • Curriculum - Work Study Education - Alternance 2eme annee
see the course schedule for 2025-2026

Additional Information

Course ID : 4MM1AA
Course language(s): FR

The course is attached to the following structures:

  • Team Programming and Software
  • Team Search Algorithms-Programming-set operating

You can find this course among all other courses.

Bibliography

Cormen, Leiserson, Stein, Rivest, Introduction à l'algorithmique, Dunod, 2004