Number of hours
- Lectures 30.0
- Tutorials 22.5
- Laboratory works 27.0
ECTS
ECTS 6.0
Goal(s)
In this course, we introduce the principles of imperative programming. The language Ada is used for all examples in the course, and for the exercises
Contact Sylvain BOULME
Content(s)
- modular programming, exceptions, arrays, pointers, recursion.
- elementary algorithms: arithmetics, sorts.
- data structures: stacks, queues, linked lists.
- introduction to reasoning with assertions (loop invariants).
- introduction to testing and debugging.
Prerequisites
None.
Test
EE = written exam, EMA = computer-based exam about programming in Ada,
EMU = computer-based exam about using Unix, TPL1 & TPL2 = home work in Ada, TPU = home work about programming in Bash
N1=(10xEE+8xEMA+TPL1+TPL2)/20
N2=EE2
Le soutien n'est pas noté.
Additional Information
This course may be followed in french or in english
Curriculum->CORE->Semester 1
Bibliography
J.BARNES : "Programming in Ada 2005", Pearson Education Limited, 2006
J.BARNES : "Programmer en Ada 95", Addison Wesley, 1996
C. FROIDEVAUX, M.C.GAUDEL, M.SORIA : "Types de données et algorithmes", McGraw-Hill, 1990