Ensimag Rubrique Formation 2022

Algorithms and data structures 1 - 3MMALG11

  • Number of hours

    • Lectures 16.5
    • Tutorials 33.0
    • Laboratory works 25.5

    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 Frédéric WAGNER

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=(10*E1+8*ExamTP+TPL1+TPL2)/20
N2=E2

Additional Information

Curriculum->CORE->Semester 1
Team->Programming and Software

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