Study programme 2025-2026Français
Computer Science : Data Structures and Algorithmes
Programme component of Bachelor's in Engineering (CHARLEROI) (day schedule) à la Faculty of Engineering

CodeTypeHead of UE Department’s
contact details
Teacher(s)
UI-B1-IRCIVI-109-CCompulsory UEMAHMOUDI SaïdF114 - Informatique, Logiciel et Intelligence artificielle
  • MAHMOUDI Saïd
  • BENJELLOUN Mohammed

Language
of instruction
Language
of assessment
HT(*) HTPE(*) HTPS(*) HR(*) HD(*) CreditsWeighting Term
  • Français
Français244800066.001st term

AA CodeTeaching Activity (AA) HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term Weighting
I-ILIA-110Algorithms and data structures240000Q133.33%
I-ILIA-111Computing - practical programming048000Q166.67%

Programme component

Objectives of Programme's Learning Outcomes

  • Implement an engineering approach dealing with a set problem taking into account technical, economic and environmental constraints
    • Implement a chosen solution in the form of a drawing, a schema, a plan, a model, a prototype, software and/or digital model
    • Identify and acquire the information and skills needed to solve the problem
  • Understand the theoretical and methodological fundamentals in science and engineering to solve problems involving these disciplines
    • Identify, describe and explain basic scientific and mathematical principles
    • Select and rigorously apply knowledge, tools and methods in sciences and engineering to solve problems involving these disciplines
  • Demonstrate thoroughness and independence throughout their studies
    • Direct their choice of modules within their degree programme in order to develop a career plan in line with the realities in the field and their profile (aspirations, strengths, weaknesses, etc.)

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

AAType of Teaching Activity/Activities
I-ILIA-110
  • Cours magistraux
I-ILIA-111
  • Exercices dirigés
  • Travaux pratiques
  • Travaux de laboratoire
  • Etudes de cas

Mode of delivery

AAMode of delivery
I-ILIA-110
  • Face-to-face
I-ILIA-111
  • Face-to-face

Required Learning Resources/Tools

AARequired Learning Resources/Tools
I-ILIA-110- Les fondements de l'informatique - Du bit au Cloud Computing, de Hugues BersiniMarie-Paule Spinette-RoseRobert Spinette-RoseNicolas 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-111Not applicable

Recommended Learning Resources/Tools

AARecommended Learning Resources/Tools
I-ILIA-110Not applicable 
I-ILIA-111Not applicable

Other Recommended Reading

AAOther Recommended Reading
I-ILIA-110Not applicable 
I-ILIA-111Not applicable

Grade Deferrals of AAs from one year to the next

AAGrade Deferrals of AAs from one year to the next
I-ILIA-110Authorized
I-ILIA-111Authorized

Term 1 Assessment - type

AAType(s) and mode(s) of Q1 assessment
I-ILIA-110
  • Written examination - Face-to-face
  • Graded assignment(s) - Face-to-face
I-ILIA-111
  • Oral examination - Face-to-face
  • Graded assignment(s) - Face-to-face
  • Practical exam - Face-to-face

Term 1 Assessment - comments

AATerm 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-111A 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

AAType(s) and mode(s) of Q1 resit assessment (BAB1)
I-ILIA-110
  • Written examination - Face-to-face
  • Graded assignment(s) - Face-to-face
I-ILIA-111
  • Written examination - Face-to-face
  • Oral examination - Face-to-face

Resit Assessment - Term 1 (BAB1) - Comments

AAResit Assessment - Term 1 (BAB1) - Comments
I-ILIA-110written examination (duration 2.5 hours, in session).
I-ILIA-111Oral 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

AAType(s) and mode(s) of Q3 assessment
I-ILIA-110
  • Written examination - Face-to-face
  • Graded assignment(s) - Face-to-face
I-ILIA-111
  • Written examination - Face-to-face
  • Oral examination - Face-to-face

Term 3 Assessment - comments

AATerm 3 Assessment - comments
I-ILIA-110written examination (duration 2.5 hours, in session).
I-ILIA-111Oral 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.
(*) HT : Hours of theory - HTPE : Hours of in-class exercices - HTPS : hours of practical work - HD : HMiscellaneous time - HR : Hours of remedial classes. - Per. (Period), Y=Year, Q1=1st term et Q2=2nd term
Date de dernière mise à jour de la fiche ECTS par l'enseignant : 16/05/2025
Date de dernière génération automatique de la page : 14/03/2026
20, place du Parc, B7000 Mons - Belgique
Tél: +32 (0)65 373111
Courriel: info.mons@umons.ac.be