Сư³æ´«Ã½

Teacher(s)

. SOMEBODY; Jodogne Sébastien; Sadre Ramin; Schaus Pierre;

Language

French

Prerequisites

This course assumes that you have acquired the basic notions of programming (instructions, variables, loops, conditions, etc.) as taught in the LEPL1401 or LINFO1101 course.

The prerequisite(s) for this Teaching Unit (Unité d’enseignement – UE) for the programmes/courses that offer this Teaching Unit are specified at the end of this sheet.

Main themes

- The Java language;
- Abstract data types;
- Linear and tree structures;
- Recursive programming and algorithm;
- Technique of reasoning on the accuracy of programs;
- Notions of computational complexity of an algorithm;
- Functional programming;
- Modeling and object-oriented programming;
- Parallel programming;
- Program testing.

Learning outcomes

At the end of this learning unit, the student is able to :
1	With regard to the AA reference of the program "Bachelor in Engineering Sciences, orientation civil engineer", this course contributes to the development, acquisition and evaluation of learning outcomes. following: - AA 1.1, 1.2 -AA 2.3, 2.4, 2.5, 2.6, 2.7 -AA 4.2, 4.3, 4.4 More specifically, at the end of the course, the student will be able to: - make a justified choice between several representations of information and several algorithms to process them, - design (fragments of) programs in a functional style, - reasoning about (fragments of) programs: complexity of algorithms and efficiency of programs implementing them, recursive reasoning, - apply object-oriented modeling principles, - design and apply methods for testing a program, - design a simple parallel program Students will have developed methodological and operational skills. In particular, they will have developed their ability to: - Analyze a medium-sized problem, propose a computer solution to solve it and implement it in the Java language.

Content

This teaching unit focuses on:

• Introduction to Java: compilation, byte-code, virtual machine, primitive type, strings, tables;
• Abstract data types;
• Linear and tree structures, and their applications;
• Recursive solution formulation and recursive algorithms;
• Reasoning technique: preconditions, postconditions, invariants;
• Notions of computational complexity and analysis of the temporal and spatial complexity of an algorithm;
• Functional programming and higher-order programming;
• Object-oriented modeling (inheritance, composition, reuse, polymorphism, class invariant);
• Introduction to design patterns;
• Program testing and validation methods;
• Introduction to parallelization: notion of threads and synchronization mechanisms.

Students who have successfully completed this course will be able to:

• Design Java programs;
• Analyze programs according to their performance;
• Prove correctness of programs using invariants;
• Apply the principles of object-oriented programming such as genericity, abstraction, composition, and reuse;
• Design and implement variants of the algorithms studied in high-quality Java programs;
• Design and manipulate simple linear, tree, and recursive structures;
• Design tests for programs;
• Design functional programming approaches to solve small algorithmic problems;
• Use design patterns;
• Design simple parallel programs with synchronization mechanisms.

Teaching methods

The teachers will present the material in a traditional classroom setting, using the textbook entitled "Programming Concepts in Java".
For each topic covered, exercises are continuously available on the INGInious platform, allowing the application of theoretical concepts.
During the practical sessions, assistants or tutors will be present to support and guide the students.
Each student is fully responsible for his or her own learning. To succeed in the computer exam, it is essential for students to practice Java on a regular basis using the IntelliJ tool.

Evaluation methods

An exam on INGInious takes place at the end of the term. The aim of this exam is to verify not only knowledge of the material, but also the ability to apply the acquired knowledge to write programs.
An optional individual quiz is held halfway through the term, counting for a maximum of two points in the final course grade, and only if it is to the benefit of the student. The use of generative AI tools and any collaboration is strictly prohibited during this quiz.
The final grade is calculated using the formula: final_grade_out_of_20 = max(quiz_out_of_2 + exam_out_of_18, exam_out_of_20). The points obtained for the quiz will be retained for the August session.
In case of suspected plagiarism (for example, detected using a plagiarism tool), the course instructors reserve the right to ask the student to take an oral examination on the quiz or the exam.

Online resources

(for the lecture notes)
(Moodle for communication with the students and for the slides)
(for the exercises)

Faculty or entity

> BTCI