Study programme 2021-2022Français
Data Structures I
Learning Activity
CodeLecturer(s)Associate Lecturer(s)Subsitute Lecturer(s) et other(s)Establishment
    • BRUYERE Véronique
    • MELOT Hadrien
      • UMONS
      of instruction
      of assessment
      HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term

      Content of Learning Activity

      - complexity of algorithms in the worse case
      - iterative programming, loop invariants
      - recursive programming, correctness and termination of recursive algorithms
      - data structures : lists and their basic algorithms - data structures : trees and their basic algorithms
      - data structures : graphs and their basic algorithms

      Required Learning Resources/Tools

      Not applicable

      Recommended Learning Resources/Tools

      Not applicable

      Other Recommended Reading

      - Aho, A. et Ullman, J., Concepts fondamentaux de l'informatique, Dunod (1993)

      Mode of delivery

      • Face to face

      Type of Teaching Activity/Activities

      • Cours magistraux
      • Exercices dirigés


      The assessment methods of the Learning Activity (AA) are specified in the course description of the corresponding Educational Component (UE)

      (*) 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 génération : 01/10/2021
      20, place du Parc, B7000 Mons - Belgique
      Tél: +32 (0)65 373111