Program conception methods

lingi1122  2017-2018  Louvain-la-Neuve

Program conception methods
5 credits
30.0 h + 30.0 h
Q2
Teacher(s)
Pecheur Charles;
Language
French
Prerequisites
Within SINF1BA : LSINF1225
Within FSA1BA : LFSAB1101, LFSAB1102, LFSAB120&, LFSAB1202, FSAB1301, LFSAB1401

The prerequisite(s) for this Teaching Unit (Unité d’enseignement – UE) for the programmes/courses that offer this Teaching Unit are specified at the end of this sheet.
Main themes
  • Methods to design and prove programs
  • Program transformations and techniques used to improve the efficiency
  • Program schemes and problem classes
Aims

At the end of this learning unit, the student is able to :

1

Given the learning outcomes of the "Bachelor in Engineering" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:

  • AA1.1, AA1.2
  • AA2.4, AA2.7

Given the learning outcomes of the "Bachelor in Computer science" program, this course contributes to the development, acquisition and evaluation of the following learning outcomes:

  • S1.I5
  • S2.2-3

Students completing successfully this course will be able to

  • imagine a correct and efficient algorithm to solve a given problem
  • create and specify the design for a software product using an accepted program design methodology and appropriate design notation
  • demonstrate the exactness of complex algorithms

Students will have developed skills and operational methodology. In particular, they have developed their ability to

  • use a rigorous approach to ensure the correctness of the result, using mathematical tools
 

The contribution of this Teaching Unit to the development and command of the skills and learning outcomes of the programme(s) can be accessed at the end of this sheet, in the section entitled “Programmes/courses offering this Teaching Unit”.
Content
  • Methods to design and prove programs : invariant methods, wp calculus, induction on structures.
  • Program transformations and techniques used to improve the efficiency
  • Program schemes and problem classes: global research schemes (backward path, selection and evaluation, binary research), local research schemes (voracious strategy; gradient research, simulated annealing), structural reduction schemes (split to reign, dynamic programming, relaxation, constraints).
Teaching methods
  • Lectures every week
  • Practical exercises in which students apply in simple situations the concepts described in the lectures
  • Project to practice techniques in the case of a larger application
Evaluation methods
In June, the final mark will consist of continuous assessment (25%) and the examination (75%).
In September, the final mark will be based only of the examination (100%).
Other information
Background :
  • SINF1225 experience in small-software programming
  • SINF1121algorithms and data structures 
  • INGI1101 logical reasoning and reasoning by induction
Online resources
http://icampus.uclouvain.be/claroline/course/index.php?cid=INGI2122
Bibliography
  • syllabus en ligne
  • énoncés d'exercices en ligne
Faculty or entity
INFO


Programmes / formations proposant cette unité d'enseignement (UE)

Title of the programme
Sigle
Credits
Prerequisites
Aims
Master [120] in Forests and Natural Areas Engineering
BIRF2M
5
Master [120] in Agricultural Bioengineering
BIRA2M
5
Master [120] in Chemistry and Bioindustries
BIRC2M
5
Bachelor in Computer Science
SINF1BA
5
LSINF1225 AND LSINF1101 AND LSINF1102 AND LSINF1103
Master [120] in Environmental Bioengineering
BIRE2M
5
Minor in Computer Sciences
LINFO100I
5
LSINF1225