Study programme 2023-2024 | Français | ||
Data Structures and Algorithms | |||
Learning Activity |
Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) | Establishment |
---|---|---|---|---|
I-ILIA-001 |
|
|
|
Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
---|---|---|---|---|---|---|---|
Français | Français | 22 | 30 | 0 | 8 | 0 | Q2 |
Content of Learning Activity
Design of algorithms with sequence, iteration, modularity and recursivity. Binary coding. Definition and construction of data types and structures (basic types, array, file, list, stack, file, trees). Searching and sorting algorithms. Dynamic data structures, Python programming language.
Required Learning Resources/Tools
Not applicable
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
Les fondements de l'informatique - Du bit au Cloud Computing, de Hugues Bersini, Marie-Paule Spinette-Rose, Robert Spinette-Rose, Nicolas Van Zeebroeck , 2014, Editeur : VUIBERT
Informatique et algorithmique, Goldschlager, Lister, Interéditions, 1986.
Structures de données et algorithmes, Wirth, Prentice Hall, 1976
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)
Location of learning activity
Location of assessment