L1 IT PORTAL

See full page

Mathematical tools for EEA :

• bypass,

• the

• complex.

See full page

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

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

Basic mathematical concepts for computer science, with a focus on :

• combinatorics and counting,

• logic,

• sequences and recurrences,

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

See full page

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

Introduction to Web application programming

See full page

This course is aimed at computer scientists and presents the main models and results of collective choice. 

See full page

Select and implement a conventional combinatorial and/or sequential digital circuit. Understand how a computer architecture works. Principles of computer architectures (instruction search, instruction sequencing, memory access, interrupts).

See full page

See full page

The aim is to provide the minimum mathematical foundation required for a degree in computer science.

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

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

Basic mathematical concepts for computer science, with a focus on :

• combinatorics and counting,

• logic,

• sequences and recurrences,

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

At the end of the module, students should be able to develop (imperative) programs in Python from simple specifications.

See full page