Course unit

TB1 - PARADIGMS FOR DISCRETE PROBLEM SOLVING

Last updated: 22/02/2024

Edit

Course Director(s):

JUGANARU-MATHIEU Mihaela

General Description:

In his professional capacity every engineer will be confronted by the design and implementation of problem solving methods related for example to Management and Resource Allocation, Planning, Organisation, Scheduling .., in other words numerous problems of a discrete nature, i.e. able to be modelled by finite structures and which are encountered in fields as varied as Healthcare, the Environment, Production management, ..and of course in Computer Science.

In general these problems can be solved by several different methods but cost assessments must be made. In addition, the sought for algorithms should ideally be the most economical in terms of means, of time … The programme has thus been designed to provide some clarifications and possible pathways for processing and concretely solving this type of problem, while being able to measure the effectiveness of algorithms and their limitations.

The idea therefore is to undertake a reasoned overview of numerous possible classical strategies for problem solving; Algorithmic Paradigms. Secondly the aim is to present the essential results concerning a classification of problems based on the “difficulty” (complexity) involved in solving them by algorithms: i.e. an initiation into the “Theory of Complexity”. Finally, while not always being able to solve a problem exactly and efficiently, some methods of approximation solution calculations will be examined, along with the issues raised by such an approach.

Key words:

Algorithm design and analysis Problem solving Theory of Complexity Approximate methods Biologically inspired algorithms

Number of teaching hours

Fields of study

Teaching language

Intended learning outcomes

On completion of the unit, the student will be capable of: Classification level Priority

Learning assessment methods

Percentage ratio of individual assessment Percentage ratio of group assessment
Written exam: % Project submission: %
Individual oral exam: % Group presentation: %
Individual presentation: % Group practical exercise: %
Individual practical exercise: % Group report: %
Individual report: %
Other(s): %

Programme and content

Type of teaching activity Content, sequencing and organisation