![]() | Study programme 2025-2026 | Français | |
![]() | Computer Science : Data Structures and Algorithmes | ||
Programme component of Bachelor's in Engineering (CHARLEROI) (day schedule) à la Faculty of Engineering |
| Code | Type | Head of UE | Department’s contact details | Teacher(s) |
|---|---|---|---|---|
| UI-B1-IRCIVI-109-C | Compulsory UE | MAHMOUDI Saïd | F114 - Informatique, Logiciel et Intelligence artificielle |
|
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Credits | Weighting | Term |
|---|---|---|---|---|---|---|---|---|---|
| Français | 24 | 48 | 0 | 0 | 0 | 6 | 6.00 | 1st term |
| AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | Weighting |
|---|---|---|---|---|---|---|---|---|
| I-ILIA-110 | Algorithms and data structures | 24 | 0 | 0 | 0 | 0 | Q1 | 33.33% |
| I-ILIA-111 | Computing - practical programming | 0 | 48 | 0 | 0 | 0 | Q1 | 66.67% |
| Programme component |
|---|
Objectives of Programme's Learning Outcomes
Learning Outcomes of UE
After this teaching, students will be able to:
- Explain the main concepts of the algorithmic and the data structures in connection with the basic characteristics of computer science - Find and implement algorithms with a programming language
- Describe the basic characteristics of computers and operating systems
UE Content: description and pedagogical relevance
Design of algorithms with sequence, iteration, modularity and recursivity Definition and construction of data types and structures (basic types, array, record, file, pointer, list, heap, file, trees ). Searching and sorting algorithms, recursion. Dynamic data structures. C++ programming language.
Prior Experience
Not applicable
Type of Teaching Activity/Activities
| AA | Type of Teaching Activity/Activities |
|---|---|
| I-ILIA-110 |
|
| I-ILIA-111 |
|
Mode of delivery
| AA | Mode of delivery |
|---|---|
| I-ILIA-110 |
|
| I-ILIA-111 |
|
Required Learning Resources/Tools
| AA | Required Learning Resources/Tools |
|---|---|
| I-ILIA-110 | - Les fondements de l'informatique - Du bit au Cloud Computing, de Hugues Bersini, Marie-Paule Spinette-Rose, Robert Spinette-Rose, Nicolas Van Zeebroeck , 2014, Editeur : VUIBERT - Informatique et algorithmique, Goldschlager, Lister, Interéditions, 1986. - Structures de données et algorithmes, Wirth, Prentice Hall, 1976 |
| I-ILIA-111 | Not applicable |
Recommended Learning Resources/Tools
| AA | Recommended Learning Resources/Tools |
|---|---|
| I-ILIA-110 | Not applicable |
| I-ILIA-111 | Not applicable |
Other Recommended Reading
| AA | Other Recommended Reading |
|---|---|
| I-ILIA-110 | Not applicable |
| I-ILIA-111 | Not applicable |
Grade Deferrals of AAs from one year to the next
| AA | Grade Deferrals of AAs from one year to the next |
|---|---|
| I-ILIA-110 | Authorized |
| I-ILIA-111 | Authorized |
Term 1 Assessment - type
| AA | Type(s) and mode(s) of Q1 assessment |
|---|---|
| I-ILIA-110 |
|
| I-ILIA-111 |
|
Term 1 Assessment - comments
| AA | Term 1 Assessment - comments |
|---|---|
| I-ILIA-110 | - Dispensatory graded exercise on the first 2 chapters of the course and written examination (duration 2.5 hours, in session). If the mark for the dispensatory assessment is higher than 10/20, the student will only be questioned on the 2nd part of the course during the written exam, his mark for the theory will be equal to the average of the two tests. If the mark for the dispensatory assessment is less than 10/20, the student will be questioned on the whole of the subject during the written session (with an adapted test duration). |
| I-ILIA-111 | A practical works evaluation ; 15% of the mark. Oral exam with a maximum of 4h00 for the writing of a program. The student has to explain and justify the correctness of their program with various sets of data. The student is asked questions and has to comment on all, or a part, of the source code of their program. This counts for 85% of the mark. |
Resit Assessment - Term 1 (BAB1) - type
| AA | Type(s) and mode(s) of Q1 resit assessment (BAB1) |
|---|---|
| I-ILIA-110 |
|
| I-ILIA-111 |
|
Resit Assessment - Term 1 (BAB1) - Comments
| AA | Resit Assessment - Term 1 (BAB1) - Comments |
|---|---|
| I-ILIA-110 | written examination (duration 2.5 hours, in session). |
| I-ILIA-111 | Oral examination : 100% of the mark. The oral examination is practical exercises where the student must develop an application with C++ language. The student has to explain and justify the correctness of his program with various sets of data. Questions are asked to the student who has to comment all or a part of the source code of his program. |
Term 3 Assessment - type
| AA | Type(s) and mode(s) of Q3 assessment |
|---|---|
| I-ILIA-110 |
|
| I-ILIA-111 |
|
Term 3 Assessment - comments
| AA | Term 3 Assessment - comments |
|---|---|
| I-ILIA-110 | written examination (duration 2.5 hours, in session). |
| I-ILIA-111 | Oral examination : 100% of the mark. The oral examination is practical exercises where the student must develop an application with C++ language. The student has to explain and justify the correctness of his program with various sets of data. Questions are asked to the student who has to comment all or a part of the source code of his program. |