Algorithms and Discrete Optimization - 4MMAOD6

Number of hours
- Lectures 7.5
- Projects -
- Tutorials 9.0
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 1.5

Goal(s)

in this course, we learn object oriented programming and study how to provide solutions to complex algorithmic problems. The course covers an introduction to OO programming, the design of algorithms driven by the analysis of their cost, and their implementation with an object oriented language. It is illustrated by the study of optimization problems using different techniques such as branch and bound, dynamic programming. Concepts are applied with practical training.

Responsible(s)

Jean-Louis ROCH

Content(s)

Basis of OOP: concept of object, writing of classes and using of objects.
Recall of: cost and analysis of algorithms (time and memory cost; worst, average and amortized case analysis).
Abstract date type for sets of objects (containers and iterators): study and using via the notion of interface and a library of components.
Graphs – recall of the representations and OO implementation.
Modelling of some optimization problems with graph and shortest path.
Polymorphism, inheritance.
Recursive programming, Branch & Bound.
Design of complex data structures – cost and OO design
The language Java will be used. Two practical trainings (free time, by pairs) consist in programming some algorithms studied in class, with an OO language.

Prerequisites

Algorithmic and Data Structures 1 and 2.
Imperative programming (iteration, recursion, programming with procedures, genericity; practical training). Elementary and classical data structures (arrays, lists, trees, priority queues, dictionaries, hash tables).

Test

Continuous control: TP (by group of at most 2 students): 50% of the mark
Examination: 2 hours written exam. Authorized documents: 1 A4 sheet (recto-verso) with personal notes
N1 : 50% practical works + 50% exam 2 hours
N2 : written exam 2 hours