Study programme 2015 - 2016
Programme component of Master's Degree in Computer Science à la Faculty of Science
CodeTypeHead of UE Department’s
contact details
Teacher(s)
US-M1-SCINFO-047-MCompulsory UEBRUYERE VéroniqueS829 - Informatique théorique
    Language
    of instruction
    Language
    of assessment
    HT(*) HTPE(*) HTPS(*) HR(*) HD(*) CreditsWeighting Term
      Français0000066
      AA CodeTeaching Activity (AA) HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term
      S-INFO-020
      S-INFO-820
      Integrated Assessment: There will be an overall assessment for the entire Programme component (UE) instead of individual assessments for each Teaching Activity (AA)

      Objectives of general skills

      • Have acquired highly specialised and integrated knowledge and broad skills in the various disciplines of computer science, which come after those within the Bachelor's in computer science.
      • Manage large-scale software development projects.
        • Apply, mobilise, articulate and promote the knowledge and skills acquired in order to help lead and complete a project.
        • Lead a project by mastering its complexity and taking into account the objectives, allocated resources and constraints that characterise it.
        • Demonstrate independence and their ability to work alone or in teams.
      • Manage research, development and innovation.
        • Understand unprecedented problems in computer science and its applications.
      • Master communication techniques.
        • Communicate, both orally and in writing, their findings, original proposals, knowledge and underlying principles, in a clear, structured and justified manner.
      • Develop and integrate a high degree of autonomy.
        • Aquire new knowledge independently.

      UE's Learning outcomes

      To understand how to efficiently solve problems of sorting and dictionnary management, thanks to adapted data structures. To be able to use them to solve a given problem.

      UE Content

      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.

      Project by group of two or three students on a problem to solve thanks to efficient algortihms and adequate data structures. Implementation of the proposed algorithms

      Prior experience

      Basic algorithmics and data structures

      Term 1 for Integrated Assessment - type

      • Oral examination

      Term 1 for Integrated Assessment - comments

      Oral examination (2/3)
      A failure in one of the AAs involves the failure for the whole learning unit

      Term 2 for Integrated Assessment - type

      • Presentation and works

      Term 2 for Integrated Assessment - comments

      Presentation and works (1/3)
      A failure in one of the AAs involves the failure for the whole learning unit

      Term 3 for Integrated Assessment - type

      • Presentation and works
      • Oral examination

      Term 3 for Integrated Assessment - comments

      Oral examination (2/3)
      Presentation and works (1/3)
      A failure in one of the AAs involves the failure for the whole learning unit

      Resit Assessment for IT - Term 1 (B1BA1) - Comments

      Not applicable

      Type of Teaching Activity/Activities

      AA
      S-INFO-020
      S-INFO-820

      Mode of delivery

      AA
      S-INFO-020
      S-INFO-820

      Required Reading

      AA
      S-INFO-020
      S-INFO-820

      Required Learning Resources/Tools

      AA
      S-INFO-020
      S-INFO-820

      Recommended Reading

      AA
      S-INFO-020
      S-INFO-820

      Recommended Learning Resources/Tools

      AA
      S-INFO-020
      S-INFO-820

      Other Recommended Reading

      AA
      S-INFO-020
      S-INFO-820
      UE : Programme component - AA : Teaching activity
      (*) 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
      Integrated Assessment: There will be an overall assessment for the entire Programme component (UE) instead of individual assessments for each Teaching Activity (AA)