Number of hours
- Lectures 36.0
- Projects -
- Tutorials 36.0
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 6.0
Goal(s)
The aim of this course is to extend the knowledge and practice in algorithms and programming. It ranges from basic to advanced algorithms and data structure, with strong theoretical notions (assertions, cost and complexity, ...). Both imperative and object-oriented programming paradigms will be covered.
Responsible(s)
Xavier NICOLLIN
Content(s)
- Object-Oriented Programming (Java): basis (classes and objects,
encapsulation) ; inheritance and polymorphism ; data abstraction ;
containers ; libraries of components.
- Imperative Programming (C) : arrays, pointers, functions, basic data
structure implementation
- Algorithms : sequential access ; data structures (arrays, linked lists, stacks, queues, trees, graphs, hash tables); recursivity; introduction to dynamic programming
- Analysis of algorithms : complexity ; proof of termination; proof of correctness
Test
Evaluation : 50% of Devoir à la maison + TP notés and 50% of Examen Ecrit (N.C.)
Resit : 40% of Devoir à la maison + TP notés (reported score) and 60% of Examen Ecrit (2h)
Calendar
The course exists in the following branches:
- Curriculum - Work Study Education - Alternance 1ere annee
Additional Information
Course ID : 3MM1AP
Course language(s): 
The course is attached to the following structures:
- Team Programming and Software
- Team Search Algorithms-Programming-set operating
You can find this course among all other courses.
Bibliography
H. ABELSON, G.SUSSMAN, J.SUSSMAN : "Structure and interpretation of
computer programs", McGraw-Hill, 1985 ; "Structure et interprétation
des programmes informatiques", InterEditions, 1989
C. FROIDEVAUX, M.C.GAUDEL, M.SORIA : "Types de données et
algorithmes", McGraw-Hill, 1990
A. V. Aho, J. E. Hopcroft, J. D. Ullman : Data Structures and
Algorithms, Addison-Wesley, 1985.