 | Study programme 2022-2023 | Français | |
| Algorithmics | |||
Learning Activity |
| Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) | Establishment |
|---|---|---|---|---|
| S-INFO-048 |
|
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
|---|---|---|---|---|---|---|---|
| Français | Français | 30 | 15 | 0 | 0 | 0 | Q2 |
Content of Learning Activity
The objective of the course is to cover the basics of Algorithms in a rigorous manner. The following notions are covered in the course:
- Loop invariants
- Worst case complexity, Big-Oh notation
- Basic data structures and their operations: Lists, stacks, queues, etc.
- Trees, tree traversals, balanced trees, binary search trees
- Dichotomic search
A strong emphasis is put on learning and mastering the proof techniques used in the analysis of the algorithms.
Required Learning Resources/Tools
Not applicable
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
Not applicable
Mode of delivery
- Face-to-face
Type of Teaching Activity/Activities
- Cours magistraux
- Conférences
Evaluations
The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)