L1 IT PORTAL

See the full page

Mathematical tools for EEA:

• derivation,

• integration,

• complexes.

See the full page

See the full page

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

The algorithms presented will focus on problems related to sorting, stacks, queues, arrays, etc. 

See the full page

This course aims to introduce the functional programming paradigm. First, we will discuss lambda calculus, which is the computational model on which functional languages are based. Then, we will move on to teaching 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.

If time permits, we will also look at OCaml's module system, one of the main motivations for which is to group related definitions together, but which also allows for reusability through the system of parameterized modules (functors).

See the full page

Basic math concepts for computer science, mainly including:

• combinatorics and enumeration,

• logic,

• sequences and recurrences,

See the full page

Introduction to the main concepts of computer systems

See the 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 the full page

See the full page

See the full page

Continuation of HAI101I, Algorithms 1

See the full page

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

See the full page

Introduction to Web Application Programming

See the full page

This EU is intended for an audience of computer scientists and presents the main models and results of collective choice. 

See the full page

Know how to choose and implement a conventional combinational and/or sequential digital circuit. Understand how a computer architecture works. Principles of computer architectures (instruction fetching, instruction sequencing, memory access, interrupts).

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

The objective is to provide the minimum mathematical foundations necessary for a bachelor's degree in computer science.

See the full page

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

The algorithms presented will focus on problems related to sorting, stacks, queues, arrays, etc. 

See the full page

This course aims to introduce the functional programming paradigm. First, we will discuss lambda calculus, which is the computational model on which functional languages are based. Then, we will move on to teaching 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.

If time permits, we will also look at OCaml's module system, one of the main motivations for which is to group related definitions together, but which also allows for reusability through the system of parameterized modules (functors).

See the full page

Basic math concepts for computer science, mainly including:

• combinatorics and enumeration,

• logic,

• sequences and recurrences,

See the full page

Introduction to the main concepts of computer systems

See the 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 the full page

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

See the full page

See the full page

See the full page

Continuation of HAI101I, Algorithms 1

See the full page

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

See the full page

Introduction to Web Application Programming

See the full page

This EU is intended for an audience of computer scientists and presents the main models and results of collective choice. 

See the full page

Know how to choose and implement a conventional combinational and/or sequential digital circuit. Understand how a computer architecture works. Principles of computer architectures (instruction fetching, instruction sequencing, memory access, interrupts).

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page

See the full page