Informatics 2

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 thread and synchronization mechanisms.
Students who have successfully completed this course will be able to

• to design Java programs
• analyze programs according to their performance
• to 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 and 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

Flipped classroom method:

• Theoretical lectures are available online as videos.
• Practical exercises are accessible online at any time on the INGInious platform.
• Lab sessions consist in asking support to tutors or teaching assistants.
• On-site or remote restructuration sessions allow students to ask their questions and/or to witness the resolution of selected exercises.

The learning is the responsibility of each student. To pass the exam, it is imperative that the student programs regularly and using IntelliJ.

Evaluation methods

Exam on inginious at the end of the quadrimester. The purpose of the exam in January is to test not only knowledge of the subject, but also the ability to apply the knowledge acquired to write programs.
An optional quiz is held at the mid of the quadrimester as a part of the continuing assessment.
The final grade is computed as follows: final_grade_over_20 = max(quiz_over_2 + exam_over_18, exam_over_20).
The points obtained for the quiz will be kept for the August session.
In case of detection of plagiarism confirmed by a plagiarism detection tool the course teachers reserve the right to let the student take an oral test.

Other information

Background: LEPL1401 or a similar course

Online resources

https://lepl1402.readthedocs.io/ (links to the slides and other course contents).
https://moodleucl.uclouvain.be/course/view.php?id=12884 Moodle et/ou Teams (communication with the students).
https://inginious.info.ucl.ac.be/course/LEPL1402 for the exercises.

Faculty or entity

BTCI