Program conception methods [ LINGI1122 ]

• algorithms and data structures (as taught in the course SINF1121)
  
• experience in small-software programming small (as provided by the course SINF1121)
• logical reasoning and reasoning by induction (as praticed in the course INGI1101)

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

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
  

• written exam
• project or test during the semester

• 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