Study programme 2019-2020Français
Data Structures
Learning Activity
CodeLecturer(s)Associate Lecturer(s)Subsitute Lecturer(s) et other(s)Establishment
S-INFO-105
  • BRUYERE Véronique
    • MASLOWSKI Dany
    • Université de Mons
    Language
    of instruction
    Language
    of assessment
    HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term
    FrançaisFrançais3015000Q1

    Organisational online arrangements for the end of Q3 2019-2020 assessments (Covid-19)
    • Written exam (multiple choice, open questions)

    Content of Learning Activity

    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.

    Required Learning Resources/Tools

    Not applicable

    Recommended Learning Resources/Tools

    Not applicable

    Other Recommended Reading

    Introduction to algorithms, by Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest (1991). The MIT Press, Mc Graw-Hill.

    Mode of delivery

    • Face to face

    Type of Teaching Activity/Activities

    • Cours magistraux
    • Exercices dirigés

    Evaluations

    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 : 13/07/2020
    20, place du Parc, B7000 Mons - Belgique
    Tél: +32 (0)65 373111
    Courriel: info.mons@umons.ac.be