Study programme 2021-2022 | Français | ||
Data Structures I | |||
Learning Activity |
Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) | Establishment |
---|---|---|---|---|
S-INFO-009 |
|
|
Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
---|---|---|---|---|---|---|---|
Français | Français | 30 | 30 | 0 | 0 | 0 | Q2 |
Content of Learning Activity
- complexity of algorithms in the worse case
- iterative programming, loop invariants
- recursive programming, correctness and termination of recursive algorithms
- data structures : lists and their basic algorithms - data structures : trees and their basic algorithms
- data structures : graphs and their basic algorithms
Required Learning Resources/Tools
Not applicable
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
- Aho, A. et Ullman, J., Concepts fondamentaux de l'informatique, Dunod (1993)
Mode of delivery
Type of Teaching Activity/Activities
Evaluations
The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)