Number of hours
- Lectures 0
- Projects 0
- Tutorials 36.0
- Internship 0
- Laboratory works 0
- Written tests 0
ECTS
ECTS 3.0
Goal(s)
This course introduces the fundamental notions on algorithms and programming that are necessary for the Phelma students to follow the other courses in the Ensimag curriculum.
Contact Michel DESVIGNES Responsible(s)
Karine ALTISEN
Content(s)
The main topics of the Ensimag first year courses "Algorithms and Data Structures" I & II:
- Principles of imperative programming: states, assignments, assertions, sequences
- Control structures (conditional structures, iterations, exceptions), functions and procedures
- Data structures (records, arrays) and associated algorithms
- Abstract data types and genericity
- Linked data structures (lists), pointers and dynamic allocation
- Recursivity
- Advanced data structures: trees, dictionnaries, graphs, etc.
- Notions of cost and complexity
Prerequisites
Basics of imperative programming, for instance with the C langage.
Test
Final written exam (3h) + reports on the pratical work.
Calcul de la note (MCC en présentiel) :
N1=Projet
N2=E2
Calcul de la note (MCC à distance) :
N1=Projet
N2=E2
Codification pour la formule de calcul de la note :
N2=note finale de 2ème session
Projet : note de projet
Calendar
The course exists in the following branches:
- Curriculum - Embedded Systems & Connect. Devices - Semester 7
Additional Information
Course list
Curriculum->Engineering degree->Semester 7
Bibliography
Algorithmique. Cormen, Leiserson, Rivest & Stein. Dunod