| 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 | 0 | 0 | 0 | 0 | 0 | 5 | 5 |
| AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | |
|---|---|---|---|---|---|---|---|---|
| S-INFO-060 |
UE's Learning outcomes
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
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.
Prior experience
Basic algorithmics and data structures
Term 1 for Integrated Assessment - type
- Written examination
Term 1 for Integrated Assessment - comments
Written examination 100%
Term 2 for Integrated Assessment - type
- N/A
Term 2 for Integrated Assessment - comments
Not applicable
Term 3 for Integrated Assessment - type
- Written examination
Term 3 for Integrated Assessment - comments
Written examination 100%
Resit Assessment for IT - Term 1 (B1BA1) - Comments
Not applicable
Type of Teaching Activity/Activities
| AA | |
|---|---|
| S-INFO-060 |
Mode of delivery
| AA | |
|---|---|
| S-INFO-060 |
Required Reading
| AA | |
|---|---|
| S-INFO-060 |
Required Learning Resources/Tools
| AA | |
|---|---|
| S-INFO-060 |
Recommended Reading
| AA | |
|---|---|
| S-INFO-060 |
Recommended Learning Resources/Tools
| AA | |
|---|---|
| S-INFO-060 |
Other Recommended Reading
| AA | |
|---|---|
| S-INFO-060 |