| Code | Type | Head of UE | Department’s contact details | Teacher(s) |
|---|---|---|---|---|
| US-B3-SCINFO-003-M | Compulsory UE | TUYTTENS Daniel | F151 - Mathématique et Recherche opérationnelle |
| Language of instruction | Language of assessment | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Credits | Weighting | Term |
|---|---|---|---|---|---|---|---|---|---|
| Français | 0 | 0 | 0 | 0 | 0 | 5 | 5 |
| AA Code | Teaching Activity (AA) | HT(*) | HTPE(*) | HTPS(*) | HR(*) | HD(*) | Term | |
|---|---|---|---|---|---|---|---|---|
| I-MARO-011 |
Objectives of general skills
- Understand the fundamentals of computer science
- Show an understanding and deep knowledge of the concepts of computer science and mathematical formalisms used in the field of computer science
- Use the vocabulary and the correct mathematical reasoning to formulate and solve problems in the field of computer science
- Understand computer technologies
- Understand the IT involved in the different stages of the life of a computer application
- Self-train in ICT
- Demonstrate basic knowledge and know-how in related fields
- Demonstrate knowledge and basic skills in science and technology.
- Understand the fundamentals related to scientific methods
- Develop skills of abstraction and modelling through a conceptual and scientific approach
- Conduct rigorous reasoning based on scientific arguments
- Understand the fundamentals of communication
- Communicate information (both orally and in writing) relating to the field of computer science in an intelligible, clear and structured way
- Communicate a consistent and rigorous scientific argument, either orally or in writing
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 |