This page brings together the corrected exercises from the site.
Mathematics
Logical system:
Combinatorial Optimization
Logic programming:
Combinatorial optimization:
Course Synopsis – Controls – Projects:
Linear Programming
Simplex Resolution:
Course Synopsis – Controls – Projects:
Planning Problem
Algorithmic resolution:
Course Synopsis – Controls – Projects:
Path Finder
Shortest Path Problem:
Course Synopsis – Controls – Projects:
Maximum flow problem
Maximum flow problems (without constraints or minamax):
Course Synopsis – Controls – Projects:
Help with the decision
No exercises in this section
Algorithmic
Algorithmic paradigms:
- Control Structures and Data Structures
- Time complexity
- Time complexity
- Recursive, terminal, multiple and cross algorithms
- Divide and rule
- Divide and Conquer and Dynamic Programming
- Divide & conquer and dynamic programming
- Sorting algorithms
Algorithmic with software:
Robotics and multi-agents:
Optimization of space and time:
Course Synopsis – Controls – Projects:
Software analysis
Mathematics and logic model:
Database management (SQL example):
- SQL queries (beginner)
- SQL (Selection and Join)
- SQL (Integrity, Views and Confidentiality)
- SQL concurrency checks
Database optimization:
Analysis and modeling (UML example):
Polynomial reduction
Future
Game Theory
Future
Graph Theory
Modeling and Algorithms on Trees and Graphs:
- Graph and tree modeling
- Graph theory modeling and tree's problem
- Graph modeling and graph coloring
- Graph theory modeling and coloring problem
- Spanning tree problem
- Spanning tree problem
Course Synopsis – Controls – Projects:
Markov process
Markov chains in discrete time and continuous time:
Course Synopsis – Controls – Projects:
Language Theory
Construction and optimization of automata:
Course Synopsis – Controls – Projects:
Data Analysis
Descriptive Analysis:
Machine Learning / Machine Learning
Future
Artificial intelligence
Future
EN 
FR 
ES