![]() | Study programme 2025-2026 | Français | |
![]() | Data Structures II | ||
Programme component of Bachelor's in Computer Science (MONS) (day schedule) à la Faculty of Science |
| Code | Type | Head of UE | Department’s contact details | Teacher(s) |
|---|---|---|---|---|
| US-B3-SCINFO-010-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 | 24 | 0 | 30 | 0 | 0 | 6 | 6.00 | Année |
| AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | Weighting |
|---|---|---|---|---|---|---|---|---|
| S-INFO-020 | Data Structures II | 24 | 0 | 0 | 0 | 0 | Q1 | |
| S-INFO-820 | Data Structures II Project | 0 | 0 | 30 | 0 | 0 | A |
| Programme component | ||
|---|---|---|
![]() | US-B2-SCINFO-011-M Data Structures I | |
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.
UE Content: description and pedagogical relevance
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, heapsort, 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 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(s) and mode(s) of Q1 UE assessment
Q1 UE Assessment Comments
Oral examination (2/3)
A failure in one of the AAs involves the failure for the whole learning unit. In this case, the lowest score is given as the score for the learning unit.
Method of calculating the overall mark for the Q1 UE assessment
Oral examination (2/3), project (1/3)
A failure in one of the AAs involves the failure for the whole learning unit. In this case, the lowest score is given as the score for the learning unit.
Type(s) and mode(s) of Q1 UE resit assessment (BAB1)
Q1 UE Resit Assessment Comments (BAB1)
Not applicable
Method of calculating the overall mark for the Q1 UE resit assessment
Not applicable
Type(s) and mode(s) of Q2 UE assessment
Q2 UE Assessment Comments
The project is assessed as follows:
A written test is organized shortly after the project is submitted. It consists of basic questions about the project.
An oral defense of the project takes place during the June session.
Students who score less than 8/20 on the test will not be allowed to present their project orally. The test score will then be the final grade for the project. If the test score is 8/20 or higher, the final grade for the project will be based on the code, the report, and the oral defense.
Method of calculating the overall mark for the Q2 UE assessment
Oral examination (2/3), project (1/3)
A failure in one of the AAs involves the failure for the whole learning unit. In this case, the lowest score is given as the score for the learning unit.
Type(s) and mode(s) of Q3 UE assessment
Q3 UE Assessment Comments
In the second session: The project is evaluated as follows: the project grade is based on the code, the report, and the oral defense.
Method of calculating the overall mark for the Q3 UE assessment
Oral examination (2/3), project (1/3)
A failure in one of the AAs involves the failure for the whole learning unit. In this case, the lowest score is given as the score for the learning unit.
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 Learning Resources/Tools
| AA | Required Learning Resources/Tools |
|---|---|
| S-INFO-020 | Not applicable |
| S-INFO-820 | Not applicable |
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 |