Tree Data Structures and Algorithms University of Bordeaux
The main objective of this course is to focus on static or dynamicimplementations of tree data structures - binarytree with order law(ABR, AVL, B-tree), dictionary, hash table, heap andpriority queue.
- First Bachelor year in Science. - B2 level in English. - The skills and knowledge acquired in the "Algorithmic Tables","Algorithmic Elementary Data Structures" and "Functional Programming"UEs (or equivalent UEs).
Continuous assessment: one intermediary exam and one final exam.
The student will have to applyskills in abstraction, complexitycalculation and the implementation of adaptedrecursive algorithms. Starting from a"breadcrumb" problem, students will be led to solvingit successivelyusing several data structures. For each data structure,a comparison of staticand dynamic constructs, the study of theassociated algorithmic complexity, andthe writing of adapted recursivealgorithms will be addressed. Using the skills acquiredduring the previous semester in the EU"FunctionalProgramming", students will be required to develop theimplementationin Caml language of the data structures addressed.
- integrated lectures (1h20) - 12 practical sessions (1h20)
Online Course Requirement
This UE uses Ocaml programming language.Language of instruction: EnglishMode of delivery: Face-to-face teaching