Program conception methods [ LINGI1122 ]

> https://icampus.uclouvain.be/claroline/course/index.php?cid=INGI2122

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.

• Methods to design and prove programs
• Program transformations and techniques used to improve the efficiency
• Program schemes and problem classes

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 Engineering" 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”.

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%).

• 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

• 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).

• textbook online
• statement of exercises online

Background :

• SINF1225 experience in small-software programming
• SINF1121algorithms and data structures 
• INGI1101 logical reasoning and reasoning by induction