L1 COMPUTER PORTAL

See full page

Mathematical tools for EEA :

• bypass,

• and the

• complex.

See full page

See full page

In this module we present the basic concepts in algorithms (notion of 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.... 

See full page

This course aims at introducing the functional programming paradigm. First, we will talk about lambda-calculus, which is the computational model on which functional languages are based. Then, we will teach a real functional programming language, namely OCaml.

The presentation of OCaml will mainly follow the following plan:
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 the module system of OCaml, one of the main motivations of which is to group related definitions, but which also allows to introduce reusability through the system of parameterized modules (functors).

See full page

Basic mathematics for computer science with emphasis on:

• combinatorics and enumeration,

• logic,

• sequences and recurrences,

See full page

Introduction of 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 course 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

Continuation of HAI101I, Algorithms 1

See full page

Mastery of the basics of C programming; Understanding 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 intended for computer scientists and presents the main models and results of collective choice. 

See full page

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

See full page

See full page

The aim of this module is to provide skills for the analysis of DNA sequences from genomic data, from the extraction of sequences from public databases to the manipulation of these sequences in order to extract relevant information, and this in an automatic way via the use of a dedicated Python library : BioPython. 

See full page

See full page

In this module we present the basic concepts in algorithms (notion of 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.... 

See full page

This course aims at introducing the functional programming paradigm. First, we will talk about lambda-calculus, which is the computational model on which functional languages are based. Then, we will teach a real functional programming language, namely OCaml.

The presentation of OCaml will mainly follow the following plan:
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 the module system of OCaml, one of the main motivations of which is to group related definitions, but which also allows to introduce reusability through the system of parameterized modules (functors).

See full page

Basic mathematics for computer science with emphasis on:

• combinatorics and enumeration,

• logic,

• sequences and recurrences,

See full page

Introduction of 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 course we will study languages and their representation, in particular rational languages and their representation by finite state automata.

See full page

See full page

Continuation of HAI101I, Algorithms 1

See full page

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

See full page

See full page

The aim of this module is, in the continuity of the HAI109H module, to provide skills for the analysis of DNA sequences from genomic data, from the reading of DNA sequences to the comparative analysis of these sequences in order to extract relevant information, and this in an automatic way via the use of a dedicated Python library: BioPython. 

See full page

Introduction to web application programming

See full page

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

See full page

See full page

The objective is to provide the minimum mathematical foundation necessary for a computer science degree.

See full page

In this module we present the basic concepts in algorithms (notion of 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.... 

See full page

This course aims at introducing the functional programming paradigm. First, we will talk about lambda-calculus, which is the computational model on which functional languages are based. Then, we will teach a real functional programming language, namely OCaml.

The presentation of OCaml will mainly follow the following plan:
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 the module system of OCaml, one of the main motivations of which is to group related definitions, but which also allows to introduce reusability through the system of parameterized modules (functors).

See full page

Basic mathematics for computer science with emphasis on:

• combinatorics and enumeration,

• logic,

• sequences and recurrences,

See full page

Introduction of 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 course 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 a simple specification.

See full page