Course teacher(s)
Olivier MARKOWITCH (Coordinator) and Bernard FORTZECTS credits
10
Language(s) of instruction
french
Course content
(1) data structure: definitions and implementations of lists, stacks, queues, trees, heap, graphs ... as abstract data types.
(2) programming methodecursivity, quicksort, heapsort, backtracking, hashing, introduction to dynamic programming, ...
Objectives (and/or specific learning outcomes)
algorithmic approach of data structure and abstract data types
Prerequisites and Corequisites
Required and Corequired knowledge and skills
Cours co-requis
Courses requiring this course
Cours ayant celui-ci comme co-requis
Teaching methods and learning activities
Theoretical and practical lessons, individual works
References, bibliography, and recommended reading
(1) Course book ; (2) Bradley Miller, David Ranum, "Problem solving with algorithms and data structures using Python", Franklin, Beedle & Associates ; (3) Thomas Cormen, Charles Leiserson et Ronald Rivest, Introduction à l'algorithmique : Cours et exercices corrigés, Dunod
Course notes
- Syllabus
- Université virtuelle
Contribution to the teaching profile
Other information
Additional information
Contacts
Olivier Markowitch Campus de la Plaine Bâtiment NO Local 2N8.115A
Campus
Plaine, Solbosch
Evaluation
Method(s) of evaluation
- Personal work
- written examination
- Project
Personal work
written examination
Project
Written examination. Attendance at tutorials and personal work is a necessary criterion for success.
Mark calculation method (including weighting of intermediary marks)
Projects and the interrogation count for 1/5 of the final grade, the examination counts for 4/5 of the final grade. Each project is assessed by a written examination.
Language(s) of evaluation
- french