 | Study programme | Français | |
 | Data Structures II | ||
Activité d'apprentissage à la Faculty of Science |
| Code | Lecturer(s) | Associate Lecturer(s) | Subsitute Lecturer(s) et other(s) |
|---|---|---|---|
| S-INFO-020 |
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term |
|---|---|---|---|---|---|---|---|
| Français | Français | 30 | 0 | 0 | 0 | 0 | Q1 |
Content of Learning Activity
Advanced algorithms and data structures for the search, insertion and deletion of a data inside a set of data, as well as the sort of a set of data. Study of binary search trees, AVL trees, B-trees, hash tables, quicksort, optimal sorts. Study of the correctness of the algorithms, and of their complexity in the worst case and the average case.
Required Learning Resources/Tools
Not applicable
Recommended Learning Resources/Tools
Not applicable
Other Recommended Reading
Introduction to algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest (1991). The MIT Press, Mc Graw-Hill.
Mode of delivery
- Face to face
Type of Teaching Activity/Activities
- Cours magistraux
Evaluations
The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)