Joining the INP
Joining a school
Sign up
Welcome booklet
School / Prep
ENSEIRB-MATMECA
Internal code
ER6IF128
Description
One of the aims of this course is to introduce you to some of the most fundamental graph algorithmic results: graph traversal, shortest path computation, spanning tree computation, maximum flow computation, etc...
Students will put this knowledge into practice by modeling different problems and proposing algorithmic solutions.
Teaching hours
- CIIntegrated courses26h
Assessment of knowledge
Initial assessment / Main session
| Type of assessment | Nature of assessment | Duration (in minutes) | Number of tests | Evaluation coefficient | Eliminatory evaluation mark | Remarks |
|---|---|---|---|---|---|---|
| Integral Continuous Control | Continuous control | 1 |
Second chance / Catch-up session
| Type of assessment | Nature of assessment | Duration (in minutes) | Number of tests | Evaluation coefficient | Eliminatory evaluation mark | Remarks |
|---|---|---|---|---|---|---|
| Final test | Oral | 30 | 1 | authorized documents |