Objectives of Programme's Learning Outcomes

• Have acquired highly specialised and integrated knowledge and broad skills in the various disciplines of computer science, which come after those within the Bachelor's in computer science.
• Carry out development or innovation projects in IT.
• Apply, mobilise, articulate and promote the knowledge and skills acquired in order to contribute to the achievement of a development or innovation project.
• Develop and integrate a high degree of autonomy.
• Aquire new knowledge independently.

Learning Outcomes of UE

To understand how to efficiently solve problems of sorting and dictionnary management, thanks to adapted data structures. To be able to use them.

UE Content: description and pedagogical relevance

Advanced algorithms and data structures for the search, insertion and deletion of a data inside a set of data, as well as the sort of a set of data. Study of binary search trees, AVL trees, B-trees, hash tables, quicksort, optimal sorts. Study of the correctness of the algorithms, and of their complexity in the worst case and the average case.

Prior Experience

Basic algorithmics and data structures