Course teacher(s)
Jean CARDINAL (Coordinator)ECTS credits
5
Language(s) of instruction
french
Course content
This course covers first graph algorithms, studied from the data structures point of view. Several algorithms related to graphs are then studied. Other programming methods like dynamic programming and greedy algorithms are then covered.
Objectives (and/or specific learning outcomes)
Conceptualisation of algorithmic methods and structures. Optimisation of algorithms and data structures. Study of graphs in algorithmic.
Prerequisites and Corequisites
Required and corequired courses
Courses requiring this course
Cours ayant celui-ci comme co-requis
Teaching methods and learning activities
Course, exercises and individual projects.
References, bibliography, and recommended reading
- Sedgewick R., Algorithms in c++. Addison et Wesley. - Cormen, T., C. Leiserson et R. Rivest. Introduction à l'algorithmique : cours et exercices corrigés. Seconde édition. Dunod.
Other information
Contacts
Bernard Fortz Campus de la Plaine Bâtiment NO Local 2.N3.203
Evaluation
Method(s) of evaluation
- Other
Other
Written exam with open questions.