 | Study programme | Français | |
 | Data Structures I (part A) | ||
Activité d'apprentissage à la Faculty of Science |
| Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) |
|---|---|---|---|
| S-INFO-009 |
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
|---|---|---|---|---|---|---|---|
| Français | Français | 15 | 15 | 0 | 0 | 0 | Q1 |
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
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
- Face to face
Type of Teaching Activity/Activities
- Cours magistraux
- Exercices dirigés
Evaluations
The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)
Unité d’enseignement de la combinaison linguistique