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-044-MCompulsory UETUYTTENS DanielF151 - Mathématique et Recherche opérationnelle
    Language
    of instruction
    Language
    of assessment
    HT(*) HTPE(*) HTPS(*) HR(*) HD(*) CreditsWeighting Term
      Français0000055
      AA CodeTeaching Activity (AA) HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term
      I-MARO-011
      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

      • 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.
      • Manage research, development and innovation.
        • Understand unprecedented problems in computer science and its applications.
        • Methodically research valid scientific information, lead a critical analysis, propose and argue potentially innovative solutions to targeted problems.
      • 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

      Understand the fundamental notions and problems appearing in graph theory;study the corresponding algorithms;go deeply into algorithmic notions from the algorithm efficiency point of view;understand the fundamental problems and techniques of combinatorial optimization;illustrate some methods on some particular problems;show the utility of algorithms for solving practical problems in scheduling management, logistics,...

      UE Content

      Basic notions of graph theory and data structure; study of classical graph theory problems : trees, shortest paths, connexity, flows;introduction to complexity theory : P and NP classes; study of classical combinatorial optimization problems : knapsack, set covering, travelling salesman; introduction to metaheuristics.

      Prior experience

      Linear programming; duality; notion of algorithm.

      Term 1 for Integrated Assessment - comments

      Not applicable

      Term 2 for Integrated Assessment - comments

      Not applicable

      Term 3 for Integrated Assessment - comments

      Not applicable

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

      Not applicable

      Type of Teaching Activity/Activities

      AA
      I-MARO-011

      Mode of delivery

      AA
      I-MARO-011

      Required Reading

      AA
      I-MARO-011

      Required Learning Resources/Tools

      AA
      I-MARO-011

      Recommended Reading

      AA
      I-MARO-011

      Recommended Learning Resources/Tools

      AA
      I-MARO-011

      Other Recommended Reading

      AA
      I-MARO-011
      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)