Study programme 2022-2023 | 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 Definition and construction of data types and structures (basic types, array, record, file, pointer, list, heap, file, trees (general, binary, balanced, heap)) Searching and sorting algorithms. Dynamic data structures, Recursion, Python programming language.
Required Reading
Note de cours - Syllabus - théorie - Informatique -2022-2023 - Saïd Mahmoudi, M. Benjelloun, G. Libert
,Copie de présentation - Informatique - transparents du cours théorique - Saïd Mahmoudi
Required Learning Resources/Tools
Not applicable
Recommended Reading
Notes d'exercices - Introduction à la programmation en Python - Mohammed Benjelloun
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)