School of engineering in Physics, Applied Physics, Electronics & Materials
Science
> Studies
The objective is to learn the main concepts and data structures used by solutions to many problems. It addresses the recursive programming and the main dynamic data structures and abstract data types (lists, stacks, queues, trees, graphs) and presents some implementations and algorithms used by these these data structures.
Contact Francois CAYREStructured programming in C, PET-S1.
Contrôle continue : CC
Examen écrit Session1 : DS1
Examen écrit Session 2 : DS2
N1 = Note finale session 1
N2 = Note finale session 2
En présentiel :
N1 = 20% max(CC) + 80% max(Projet)
N2 = 20% max(CC1) + 80% DS2
En distanciel :
N1 = 20% max(CC) + 80% max(Projet)
N2 = 20% max(CC1) + 80% DS2
Commentaire :
Robert Sedgewick : Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms, Addison-Wesley, 2002, 0201756080
C.Froidevaux, M.C.Gaudel, M.Soria : Types de données et algorithmes , McGraw-Hill, 1990
A. Aho, J. Hopcroft, J. Ullman. Data structures and algorithms .Addison-Wesley, 1983.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest : Introduction to Algorithms. MIT Press and McGraw-Hill., Third Edition. MIT Press, 2009. ISBN 978-0-262-53305-8.
Date of update March 6, 2019