UE Algorithms and software tools

Degrees incorporating this pedagocial element :

Description

The objective of this course is to present the computer sciences basics useful for applied mathematics.

Contents:

  1. Compilation (const, inline, loops, Gnu Make …)
  2. C++: genericity (template), code reuse (STL), efficient programming
  3. Objects and hierarcical memory, notions of cache and locality (e.g., BLAS)
  4. Basics of algorithmics
  5. Complexity
  6. Error propagation, floating point computing

Prerequisites

UNIX/LINUX.

At least some programing langages (C, python, java).

 

Targeted skills

Produce code using C++, algorithms and comilation tools, taking into account complexity and errors.

 

Knowledge assessment methods

Session 1 or single session - Knowledge testing

Type of teaching providedMethodTypeDuration (min)Coefficient
Teaching Unit (UE)CC Practical50/100
Teaching Unit (UE)CT Written - supervised work12050/100

Session 2 - Knowledge testing

Type of teaching providedMethodTypeDuration (min)Coefficient
Teaching Unit (UE)CC Calculation report50/100
Teaching Unit (UE)CT Written or Oral50/100