 | Study programme 2025-2026 | Français | |
 | Data Structures | ||
Programme component of Graduate Certificate in Advanced Aspects of Software Systems (CHARLEROI) (shift schedule) à la Faculty of Science |
| Code | Type | Head of UE | Department’s contact details | Teacher(s) |
|---|---|---|---|---|
| US-U1-SYSLOB-001-C | 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 | 15 | 0 | 0 | 0 | 5 | 5.00 | 1st term |
| AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | Weighting |
|---|---|---|---|---|---|---|---|---|
| S-INFO-105 | Data Structures | 30 | 15 | 0 | 0 | 0 | Q1 | 100.00% |
| Programme component |
|---|
Objectives of Programme's Learning Outcomes
- Have acquired highly specialised and integrated knowledge and broad skills in the various disciplines of computer science, which come after those within the Bachelor's in computer science.
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.
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.
Prior Experience
Basic algorithmics and data structures
Type of Teaching Activity/Activities
| AA | Type of Teaching Activity/Activities |
|---|---|
| S-INFO-105 |
|
Mode of delivery
| AA | Mode of delivery |
|---|---|
| S-INFO-105 |
|
Required Learning Resources/Tools
| AA | Required Learning Resources/Tools |
|---|---|
| S-INFO-105 | Not applicable |
Recommended Learning Resources/Tools
| AA | Recommended Learning Resources/Tools |
|---|---|
| S-INFO-105 | Not applicable |
Other Recommended Reading
| AA | Other Recommended Reading |
|---|---|
| S-INFO-105 | Introduction to algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest (1991). The MIT Press, Mc Graw-Hill. |
Grade Deferrals of AAs from one year to the next
| AA | Grade Deferrals of AAs from one year to the next |
|---|---|
| S-INFO-105 | Authorized |
Term 1 Assessment - type
| AA | Type(s) and mode(s) of Q1 assessment |
|---|---|
| S-INFO-105 |
|
Term 1 Assessment - comments
| AA | Term 1 Assessment - comments |
|---|---|
| S-INFO-105 | Written examination 100% |
Resit Assessment - Term 1 (BAB1) - type
| AA | Type(s) and mode(s) of Q1 resit assessment (BAB1) |
|---|---|
| S-INFO-105 |
|
Resit Assessment - Term 1 (BAB1) - Comments
| AA | Resit Assessment - Term 1 (BAB1) - Comments |
|---|---|
| S-INFO-105 | Not applicable |
Term 3 Assessment - type
| AA | Type(s) and mode(s) of Q3 assessment |
|---|---|
| S-INFO-105 |
|
Term 3 Assessment - comments
| AA | Term 3 Assessment - comments |
|---|---|
| S-INFO-105 | Written examination 100% |