L2 - Computer Science

The teaching unit presents the basic principles of modeling and object-oriented programming. The supporting languages are UML and Java, with possible elements of Python at the end of the semester.

From a modeling perspective, the teaching unit focuses on modeling static views, using class and instance diagrams. These diagrams will be used to explore the concepts of classes, instances, attributes, operations, associations, interfaces, and specialization. Their parallel implementation in Java will provide a concrete application and demonstrate, in particular, how associations are translated into a programming language that does not have them. In Java, particular emphasis will be placed on the concepts of class, instance, inheritance, instance variable, class variable and method, visibility and organization into packages, and static and dynamic linking. Data collections widely used in Java will be presented to translate some of the associations (associative lists and dictionaries). These collections will introduce students to the use of generic classes. The implementation of object-oriented programming concepts with Python may be covered at the end of the semester, depending on progress.

See the full page

This teaching unit presents the design of processes in an information system and the management of relational databases. We will cover the following topics:
(1) Information systems: Introduction to the entity/association model, Relational model, Process modeling (Conceptual process model, Organizational process model),

(2) Databases: creation, manipulation, and querying of relational databases.

See the full page

Continuation of first-year EU.

See the full page

See the full page

- Formal syntax of propositional logic: symbols, connectives, well-formed formulas, syntactic trees, normal forms, and clause forms

- Semantics of propositional logic: interpretation, model, truth tables, satisfiability, validity, semantic equivalence, logical consequence

- Modeling: formalization of problems in propositional logic, expressive limits of propositional logic

- Formal proof: sequents, inference rules, axioms, theorems, LK system, resolution method

- Correctness and completeness of a system with respect to semantics: proof of correctness and completeness of LK and the resolution method (reduced to the propositional case)

- Curry-Howard correspondence

- Introduction to first-order logic (predicate calculus) without function symbols

See the full page

The objective of this course is to describe the main concepts of operating systems, particularly Unix.

See the full page

• bases and base changes,

• representation of numbers,

• modular arithmetic,

• primality, decomposition, GCD, and Bezout's identity...

See the full page

See the full page

See the full page

See the full page

Students will learn how to model and develop using advanced aspects of object-oriented programming and will have acquired good programming practices. They will learn how to create UML diagrams expressing the dynamics of interactions in a system and will consolidate their knowledge of structural modeling.

See the full page

See the full page

See the full page

See the full page

See the full page