Advanced algorithms (aa) - KAIN6M08

  • Number of hours

    • Lectures 12.0
    • Projects -
    • Tutorials 4.0
    • Internship -
    • Laboratory works 9.0
    • Written tests 3.0

    ECTS

    ECTS 0.4

Goal(s)

The course presents the basic algorithms for tree and graph structures. Different types of trees will be studied (such as ABR, AVL, ...). Several types of graphs will also be studied (oriented, weighted). Some of these algorithms will be implemented on 3 TPs. These TPs on these data structures allow students to become familiar with the dynamic mechanisms of memory allocation.

Content(s)

Data structures of trees and graphs and their most classic associated algorithms

Prerequisites

Basics on algorithmics and imperative programming

Test

40% CC
60% EXAM
- in person
- written test on paper
- 1h30
- adaptation to disability: extended test time
- authorized documents: one double-sided handwritten A4 sheet
- electronic devices: not permitted

If a UE is not validated, the jury may authorize the student engineer to take additional tests to validate it.

Calendar

The course exists in the following branches:

  • Curriculum - INFO - Semester 6

Additional Information

Course ID : KAIN6M08
Course language(s): FR

You can find this course among all other courses.

Bibliography

  • D.Beauquier, J.Berstel, P.Chrétienne - Eléments d'algorithmique - Masson, 2005
  • T.Cormen, C.Leicerson, R.Rivalst - Algorithmique - éditions Dunod, 2013