> Formation > Cursus ingénieur
This lecture completes first semester teaching in programming and algorithm design. It is focused on analysis of algorithms and advanced data structures and algorithms. Practical work is used to implement concepts studied during lectures, but also possibly to practice new concepts.
Contact Franck HETROYAnalysis of algorithms: best and worst case, average analysis and amortized cost.
Data structures:
1. Trees
2. Dictionnaries
3. Priority queues
4. Graphs
Recursive programming; divide and conquer.
Algorithms and data structures 1.
Continuous assessment (CC) + one written exam (3h max, E1) and a mark for the practical work (TP).
N1=(3*E1+TP+CC)/5
N2=E2
C. Froidevaux, M.C. Gaudel, M.Soria : Types de données et algorithmes, McGraw-Hill, 1990.
T. Cormen, C.E. Leiserson, R. Rivest, C. Stein : Introduction to Algorithms, MIT Press, 2nd edition, 2001.
A. V. Aho, J. E. Hopcroft, J. D. Ullman : Data Structures and Algorithms, Addison-Wesley, 1985.
Nos sites
e-Services
