Study programme 2017-2018 | Français | ||
Data Structures II | |||
Programme component of Master's Degree in Computer Science à la Faculty of Science |
Code | Type | Head of UE | Department’s contact details | Teacher(s) |
---|---|---|---|---|
US-M1-INFO60-019-M | Compulsory UE | BRUYERE Véronique | S829 - Informatique théorique |
|
Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Credits | Weighting | Term |
---|---|---|---|---|---|---|---|---|---|
| Français | 30 | 0 | 30 | 0 | 0 | 6 | 6 | Année |
AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | Weighting |
---|---|---|---|---|---|---|---|---|
S-INFO-020 | Data Structures II | 30 | 0 | 0 | 0 | 0 | Q1 | |
S-INFO-820 | Data Structures II Project | 0 | 0 | 30 | 0 | 0 | A |
Programme component |
---|
Objectives of Programme's Learning Outcomes
Learning Outcomes of UE
To understand how to efficiently solve problems of sorting and dictionnary management, thanks to adapted data structures. To be able to use them to solve a given problem.
Content of UE
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.
Project by group of two or three students on a problem to solve thanks to efficient algortihms and adequate data structures. Implementation of the proposed algorithms
Prior Experience
Basic algorithmics and data structures
Type of Assessment for UE in Q1
Q1 UE Assessment Comments
oral examination (2/3)
A failure in one of the AAs involves the failure for the whole learning unit
Type of Assessment for UE in Q2
Q2 UE Assessment Comments
Presentation and works (1/3)
A failure in one of the AAs involves the failure for the whole learning unit
Type of Assessment for UE in Q3
Q3 UE Assessment Comments
Oral examination (2/3)
Presentation and works (1/3)
A failure in one of the AAs involves the failure for the whole learning unit
Q1 UE Resit Assessment Comments (BAB1)
Not applicable
Type of Teaching Activity/Activities
AA | Type of Teaching Activity/Activities |
---|---|
S-INFO-020 |
|
S-INFO-820 |
|
Mode of delivery
AA | Mode of delivery |
---|---|
S-INFO-020 |
|
S-INFO-820 |
|
Required Reading
AA | |
---|---|
S-INFO-020 | |
S-INFO-820 |
Required Learning Resources/Tools
AA | Required Learning Resources/Tools |
---|---|
S-INFO-020 | Not applicable |
S-INFO-820 | Not applicable |
Recommended Reading
AA | |
---|---|
S-INFO-020 | |
S-INFO-820 |
Recommended Learning Resources/Tools
AA | Recommended Learning Resources/Tools |
---|---|
S-INFO-020 | Not applicable |
S-INFO-820 | Not applicable |
Other Recommended Reading
AA | Other Recommended Reading |
---|---|
S-INFO-020 | Introduction to algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest (1991). The MIT Press, Mc Graw-Hill. |
S-INFO-820 | Not applicable |