https://fall.metz.centralesupelec.fr/dir-001/index.html Hugo en-us https://fall.metz.centralesupelec.fr/dir-001/005/index.html Mon, 01 Jan 0001 00:00:00 +0000 https://fall.metz.centralesupelec.fr/dir-001/005/index.html Introduction to C/C++ Programming ECTS: 4 Description: This course covers C programming, focusing on execution threading (loops, function calls, recursive functions), memory manipulation (structured types, pointers, stack and heap, binary representations). The first steps towards object-oriented design (encapsulation without the syntax of an object language like C++). This course also covers the topic of separate compilation (headers, external variables, linkage, dynamic libraries, etc.). https://fall.metz.centralesupelec.fr/dir-001/006/index.html Mon, 01 Jan 0001 00:00:00 +0000 https://fall.metz.centralesupelec.fr/dir-001/006/index.html Operations research ECTS: 2 Description: The course is an introduction to combinatorial optimization problems in the applied context of operations research. The latter covers formal optimization methods useful to organizations (companies, etc.) for making rational decisions, whether in logistics, strategy (investment plans, etc.), economics, etc. This course and the optimization course are inseparable in the sense that they divide up the presentation of the various optimization techniques between them, depending on the nature of the problems these techniques solve: while the optimization course focuses on numerical analysis methods that optimize a continuous function defined in a Euclidean space, RECHOP addresses combinatorial optimization problems in a discrete space, the solution of which is more algorithmic. As a result, this course places a strong emphasis on algorithms and their complexity and can therefore be seen as an extension of the first-year course “Data Structures and Algorithms” (DSA). The course will begin by addressing combinatorial problems within the very general framework of constraint programming. We will then focus on instances of problems for which a polynomial-time solution exists, such as dynamic programming or graph matching problems. We will also develop efficient approximation algorithms for the difficult problem of integer linear programming after linear programming has been covered in the optimization course, thus linking the two courses. https://fall.metz.centralesupelec.fr/dir-001/007/index.html Mon, 01 Jan 0001 00:00:00 +0000 https://fall.metz.centralesupelec.fr/dir-001/007/index.html Langage processing ECTS: 2 Description: The objective is to introduce the concepts of language theory and put them into practice so that students fully understand and see the value of these concepts in dealing with concrete problems. We will cover regular languages, grammars, and how a compiler works. Learning outcomes: By the end of this course, students will have understood the relevance of language theory in computer science.