Study programme 2021-2022Français
Computer Science : Data Structures and Algorithmes
Programme component of Bachelor's in Engineering (Charleroi (Hor. jour)) à 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
  • BENJELLOUN Mohammed
  • MAHMOUDI Saïd

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

AA CodeTeaching Activity (AA) HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term Weighting
I-ILIA-100Computer Science : Data Structures and Algorithmes2444000Q1100.00%

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

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

Content of UE

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 (general, binary, balanced, heap)) Searching and sorting algorithms. Dynamic data structures. C++ programming language.

Prior Experience

Not applicable

Type of Assessment for UE in Q1

  • Written examination
  • Practical test
  • Graded tests
  • Remediation test

Q1 UE Assessment Comments

Written examination during 2 h on the theoretical concepts of the teaching. 50% of the mark. Oral examination during 4h with a maximum of 2h30 for the writing of a program. 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. 50% of the mark.

Type of Assessment for UE in Q3

  • Written examination
  • Practical Test

Q3 UE Assessment Comments

Written examination during 2 h on the theoretical concepts of the teaching. 50% of the mark. Oral examination during 4h with a maximum of 2h30 for the writing of a program. 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. 50% of the mark.

Type of Resit Assessment for UE in Q1 (BAB1)

  • Written examination
  • Practical test

Q1 UE Resit Assessment Comments (BAB1)

Written examination during 2 h on the theoretical concepts of the teaching. 50% of the mark. Oral examination during 4h with a maximum of 2h30 for the writing of a program. 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. 50% of the mark.

Type of Teaching Activity/Activities

AAType of Teaching Activity/Activities
I-ILIA-100
  • Cours magistraux
  • Exercices dirigés
  • Utilisation de logiciels
  • Travaux pratiques
  • Projet sur ordinateur
  • Ateliers et projets encadrés au sein de l'établissement

Mode of delivery

AAMode of delivery
I-ILIA-100
  • Mixed

Required Reading

AARequired Reading
I-ILIA-100Notes d'exercices - Introduction à la programmation en C++ - Mohammed Benjelloun
,Copie de présentation - Introduction à la programmation en C++ - Mohammed Benjelloun

Required Learning Resources/Tools

AARequired Learning Resources/Tools
I-ILIA-100Not applicable

Recommended Reading

AARecommended Reading
I-ILIA-100Travaux Pratiques - Travaux pratiques C++ - Mohammed Benjelloun

Recommended Learning Resources/Tools

AARecommended Learning Resources/Tools
I-ILIA-100Not applicable

Other Recommended Reading

AAOther Recommended Reading
I-ILIA-100Not applicable

Grade Deferrals of AAs from one year to the next

AAGrade Deferrals of AAs from one year to the next
I-ILIA-100Authorized
(*) 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/2021
Date de dernière génération automatique de la page : 06/05/2022
20, place du Parc, B7000 Mons - Belgique
Tél: +32 (0)65 373111
Courriel: info.mons@umons.ac.be