L2 - Computer Science

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

From a modeling point of view, this course focuses on static view modeling, using class and instance diagrams. These diagrams cover the notions of classes, instances, attributes, operations, associations, interfaces and specialization. Their parallel implementation in Java will give them a concrete application, and show in particular the translation of associations in a programming language that doesn't have them. In Java, particular emphasis will be placed on the notions of class, instance, inheritance, instance variable, class variable and method, visibility and package organization, and static and dynamic binding. 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. Implementation of object-oriented programming concepts with Python may be tackled at the end of the semester, depending on progress.

See full page

This teaching unit introduces the design of processing in an information system and the management of relational databases. We will cover the following points:
(1) Information systems: Introduction of the entity/association model, Relational model, Processing modeling (Conceptual processing model, Organizational processing model),

(2) Databases: creating, manipulating and querying relational databases.

See full page

Continuation of first-year UE.

See full page

See full page

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

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

- Modeling: formalizing problems in propositional logic, expressiveness limits of propositional logic

- Formal proof: sequences, inference rules, axioms, theorems, LK system, solution method

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

- Curry-Howard correspondence

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

See full page

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

See full page

• bases and changing bases,

• number representation,

• modular arithmetic,

• primality, decomposition, gcd and Bezout...

See full page

See full page

See full page

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

See full page

See full page

See full page

See full page

See full page