Course Overview

The main objective of this course is to focus on static or dynamic
implementations of tree data structures - binarytree with order law
(ABR, AVL, B-tree), dictionary, hash table, heap andpriority queue.

Learning Achievement

Competence

Course prerequisites

- 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).

Grading Philosophy

Continuous assessment: one intermediary exam and one final exam. 

Course schedule

The student will have to applyskills in abstraction, complexity
calculation and the implementation of adaptedrecursive algorithms.

 

Starting from a"breadcrumb" problem, students will be led to solving
it successivelyusing several data structures. For each data structure,
a comparison of staticand dynamic constructs, the study of the
associated algorithmic complexity, andthe writing of adapted recursive
algorithms will be addressed.

 

Using the skills acquiredduring the previous semester in the EU
"FunctionalProgramming", students will be required to develop the
implementationin Caml language of the data structures addressed.

Course type

- integrated lectures (1h20) - 12 practical sessions (1h20)

Online Course Requirement

Instructor

Other information

This UE uses Ocaml programming language.

Language of instruction: English
Mode of delivery: Face-to-face teaching

Site for Inquiry