Joining the INP
Joining a school
Sign up
Welcome booklet
School / Prep
ENSEIRB-MATMECA
Internal code
ER5IF119
Description
This course introduces and illustrates the fundamental concepts of algorithms. It begins with a number of simple, everyday examples of algorithms. These explain
the structure of an algorithm. The rest of the course introduces and manipulates the notions of variable, assignment, input/output operations, sequence, conditional structure, repetitive structures, array, file, list, procedure and function. All examples considered will be executed manually.
Teaching hours
- CIIntegrated courses28h
Assessment of knowledge
Initial assessment / Main session - Tests
| Type of assessment | Type of test | Duration (in minutes) | Number of tests | Test coefficient | Eliminatory mark in the test | Remarks |
|---|---|---|---|---|---|---|
| Semester assessment | Written | 60 | 0.5 | without document | ||
| Final inspection | Written | 120 | 0.5 | without document | ||
| Final inspection | Written | 120 | 1 | Session 1: : MAX(ES(E,sd,1h) x0.5 + ET(E,sd,2h) x0.5, ET(E,sd,2h) x1) without document |
Second chance / Catch-up session - Tests
| Type of assessment | Type of test | Duration (in minutes) | Number of tests | Test coefficient | Eliminatory mark in the test | Remarks |
|---|---|---|---|---|---|---|
| Final test | Written | 120 | 1 | Session 2: ET(E, sd, 1h) x1 without document |