Programmation Impérative 2

Objectives

Specify, define and test a program using an imperative programing langage offering modularity and genericity.

Description

Core concepts of imperative programing are taught and manipulated using a pseudo-langage for recitation classes and using ADA for labs.

These concepts are: imperative algorithmics (sequence, repetitions, conditionals), refinement method, sub-program decomposition (procedures and functions) and programing modules, data structures (arrays, records, enumerations, linked structures), genericity, recursivity, tests, offensive programming (by contract) and defensive (exceptions), abstract data types, dynamic memory allocation.

Targeted skills

Know how to design an algorithm using the successive refinments method in a imperative programing context (sequence, repetitions, conditionals, arrays, records, enumerations, pointers).

Know how to specify, define and test sub-programs (functions and procedures) and modules, possibly using genericity principles.

Understand and know how to use and write state-of-the-art algorithms (sort, search, etc.) and data structures (pile, file, lists, trees, etc.).

Pre-requisites

Programmation Impérative 1.

Students are asked to apply the core concepts of Programmation Impérative 1 in a larger programing project in ADA.

Session 1 ou session unique - Contrôle des connaissances

Session 2 - Contrôle des connaissances