Programmation Impérative 2

  • Voir la page en français

    In brief

  • Teaching language : Français
  • Teaching method : En présence
  • Code : N5EN06B


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


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

Needed prerequisite

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

CC (contrôle continu) Projet100%Projet PIM 2

Session 2 - Contrôle des connaissances

CC (contrôle continu) Projet100%Projet PIM 2




  • Toulouse


The National Institute of Electrical engineering, Electronics, Computer science,Fluid mechanics & Telecommunications and Networks

2, rue Charles Camichel - BP 7122
31071 Toulouse Cedex 7, France

+33 (0)5 34 32 20 00


  • Logo MENESR
  • Logo UTFTMP
  • Logo INP
  • Logo INPT
  • Logo Mines télécoms
  • Logo CTI
  • Logo CDEFI
  • Logo midisup