Centrale Lille Course Catalogue

Computer science

Course label : Computer science
Teaching departement : MIN / Applied Mathematics and General Computing
Teaching manager : Mister XAVIER BENY
Education language :
Potential ects : 0
Results grid :
Code and label (hp) : ENSCL_CPI_M1_1_1_2 - Mathématiques

Education team

Teachers : Mister XAVIER BENY
External contributors (business, research, secondary education): various temporary teachers

Summary

The main objective is to consolidate the algorithm basics acquired in secondary school by solving mathematical problems. The language used is Python. We also address the representation of numbers in a computer and its consequences in calculations.

Educational goals

Algorithmic fundamentals in Python Concept of a variable Integers, floating-point numbers, boolean, strings. Control structures Conditional instruction, for loop, while loop. Concept of a function Concept of a module The math, random, matplotlib, numpy, and time modules. Lists and matrices Creating, modifying, manipulating, and operations. Drawing graphics in Python Point clouds and curves Mathematical applications Calculating the nth term of a sequence Evaluation of the rate of convergence of a sequence Graphical representation of a sequence or function Approximate solution of equations (scanning algorithms, dichotomy, fixed point) Solving differential equations using the Euler method Lagrange interpolation Sorting algorithms (by selection, bubbles and insertion) Gauss pivot algorithm for linear systems Representation of numbers in computer science Basic concept for writing an integer, special cases of bases 2 and 16. Floating-point representation and practical consequences in calculations.

Sustainable development goals

Knowledge control procedures

Continuous Assessment
Comments: Two exams lasting one hour and 30 minutes each.

Online resources

Pedagogy

Ten practical work sessions lasting one hour and 30 minutes each are carried out on a computer in groups of two. They may be preceded by a brief lecture, if necessary. Students must write a brief report afterwards.

Sequencing / learning methods

Number of hours - Lectures : 8
Number of hours - Tutorial : 15
Number of hours - Practical work : 0
Number of hours - Seminar : 0
Number of hours - Half-group seminar : 0
Number of student hours in TEA (Autonomous learning) : 0
Number of student hours in TNE (Non-supervised activities) : 0
Number of hours in CB (Fixed exams) : 0
Number of student hours in PER (Personal work) : 0
Number of hours - Projects : 0

Prerequisites

Maximum number of registrants

Remarks