L1 - Double Bachelor's Degree in Computer Science and Mathematics

This UE is an introduction to linear algebra (formalized in S2), based on intuition from plane and space geometry. It includes an introduction to matrix calculus.

The UE also introduces the basic language of polynomials.

See full page

Introduction to the main concepts of computer systems

See full page

The theory of languages and automata belongs to the fundamental branch of computer science. In this teaching unit, we will study languages and their representation, in particular rational languages and their representation by finite state automata.

See full page

The aim of this UE is to rework certain analysis concepts from high school, deepening them and developing the practice and interpretation of calculations.

See full page

In this module we introduce the basic concepts of algorithms (notion of problem, problem instance, instance size, notion of complexity, termination, proof of validity).

The algorithms presented will deal with problems related to sorting, stacks, queues, arrays.... 

See full page

See full page

This course introduces the functional programming paradigm. First, we'll talk about lambda-calculus, the computational model on which functional languages are based. We then move on to teach a real functional programming language, namely OCaml.

The presentation of OCaml will mainly follow the following outline:
1. Basic types, definitions.
2. Function declarations.
3. Basic data structures (tuples, lists).
4. Advanced data structures (sum types, records).
5. Exceptions.
6. Higher-order functions, iterators on lists.

Time permitting, we'll also take a look at OCaml's module system, one of whose main motivations is to group together related definitions, but which also introduces reusability through the system of parameterized modules (functors).

See full page

See full page

This UE aims to work on plane geometry and its objects, as well as demonstrations. It also introduces complex numbers. The geometry and complex numbers sections each account for half of the UE.

- plane geometry objects: points, lines, vectors, angles, circles, triangles, etc.

- geometric transformations of the plane: symmetries, homotheties, rotations, translations.

- work on mathematical demonstration

- introduction to complex numbers, geometric interpretation, calculating with complex numbers

See full page

The aim of this course is to clarify the notions of limits of sequences and functions, to deepen the study of sequences and functions, and to study the notions of continuity and derivability of functions, as well as to introduce the main "usual" functions.

See full page

HAI101I Suite, Algorithms 1

See full page

Master the basics of C programming; understand how algorithms and abstract data structures are implemented in the machine.

See full page

The aim of this course is to introduce the elementary concepts of arithmetic and enumeration that will be useful at the beginning of a bachelor's degree in mathematics.

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

See full page

Introduction to Web application programming

See full page

This follows on from S1 (Algebra I), which introduced linear algebra in R², R³ and ^Rn, matrix calculus and polynomials with real coefficients.

The aim is to introduce a few elementary concepts of algebraic structure, and deepen work on vector spaces and linear applications, as well as polynomials.

See full page

See full page

This course follows on from S1 (Analysis I), which introduced continuity and derivability of real functions, usual functions and the study of real sequences.

The aim is to continue and deepen work on sequences and functions, and to introduce the study of numerical series.

See full page