Joining the INP
Joining a school
Sign up
Welcome booklet
School / Prep
ENSEIRB-MATMECA
Internal code
ERI5-IFON2
Description
This course aims to teach the basics of algorithmics. As such, there are several skills taught:
- Know the properties of various classic data structures (list, array, set, tree, etc.)
- Know how to build an adequate data structure for a given problem
- Be able to estimate the temporal and spatial complexity of a program
Plan:
- How to write pseudo-code / refresher course
- Simply linked lists
- Complexity
- Recursion (and proof of complexity)
- Tables
- Table sorting
- Binary trees
- Binary trees (2)
- Graphs
- Revisions
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 |
|---|---|---|---|---|---|---|
| Integral Continuous Control | Written | 1 |
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 | 60 | 1 | without document |