Algorithmique et ComplexitéPrincipes de la programmation (STI)
Algorithms and Complexity
Teaching unit Programming Principles · AS05_PRO1 | EC Code AS05_PRO1-2
6ECTS (EU)
1Coefficient
21:20Hours
Séquencement
Learning objectives
- Studying the correction and complexity of an algorithm
Prerequisites
| Module | Teaching unit | Semester |
|---|---|---|
| Mathematics 4.3 | PO STI 2 | S4 |
| Algorithms and Programming 3 | Basic Sciences 3 | S3 |
| Mathematics 1.1 | Basic Sciences 1 | S1 |
| Mathematics 1.2 | Basic Sciences 1 | S1 |
| Algorithms and Programming 1 | Optional Constitutive Elements 1 | S1 |
- Basic knowledge of imperative programming
- Manipulation of reference mathematical functions: polynomials, logarithm, exponential
Program
- Reminders on prerequisites
- Sort by insertion: correction and complexity
- Recurrence: Complexity of recursive algorithms
- Divide and Conquer
- Research binary trees
Assessment
- Group project: study of an algorithm
- Monitoring
References
Introduction to Algorithmics. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein.
Skills
1| Ref. | Verb | Description | Level |
|---|---|---|---|
| C1_1 | analyze | an algorithm | 3 |