logo Insalogo Insa

Algorithmics and Ada Programming : advanced data strucures


This course has two mains objectives :
a/ to understand concepts such as exceptions, protection and encapsulation, packages, genericity, for the design of robust and reusable programs
b/ to manage dynamic data structures (stacks, queues, lists, trees, heaps), and to implement them and their associated algorithms (insertion, deletion, update, count search, filtering) with pointers.
At the end of this course, students will be able to identify dynamic data structures in a given application, how to design them using new dedicated packages or how to reuse generic packages already designed.
This course prepares the students to Object Oriented Design and Programming.

Needed prerequisite

This course supposes the course Algorithms and Programmation I, Unix as a prerequisite.
Students should already know :
- classical control structures of an imperative programming language (conditions,
loops), and sub-programs (functions and procedures)
- the use of arrays and records
- access types (pointers) and linked lists
-basic syntax of the Ada programming language

Form of assessment

The evaluation of outcome prior learning is made as a continuous training during the semester. According ot the teaching, the assessment will be different: as a written exam, an oral exam, a record, a written report, peers review...