Note from June 29, 2020
Although we do not yet know how long the social distancing related to the Covid-19 pandemic will last, and regardless of the changes that had to be made in the evaluation of the June 2020 session in relation to what is provided for in this learning unit description, new learnig unit evaluation methods may still be adopted by the teachers; details of these methods have been - or will be - communicated to the students by the teachers, as soon as possible.
Although we do not yet know how long the social distancing related to the Covid-19 pandemic will last, and regardless of the changes that had to be made in the evaluation of the June 2020 session in relation to what is provided for in this learning unit description, new learnig unit evaluation methods may still be adopted by the teachers; details of these methods have been - or will be - communicated to the students by the teachers, as soon as possible.
5 credits
30.0 h + 30.0 h
Q2
Teacher(s)
Van Roy Peter;
Language
French
Prerequisites
This course assumes that the student already masters basic programming skills targeted by courses LINFO1101 or LEPL1401 and concepts on algorithmics and simple data structures covered by course LEPL1402.
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.
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
- Programming paradigms (including functional, object-oriented, dataflow, and multi-agent)
- Formal semantics and reasoning techniques
- Procedural abstraction (higher-order programming)
- Data abstraction (including object orientation and abstract data types)
- Concurrent programming (including shared state, message passing, and deterministic dataflow)
- Symbolic programming (including algorithm design)
Aims
At the end of this learning unit, the student is able to : | |
| 1 |
Regarding the learning outcomes of the program of Bachelor in Engineering, this course contributes to the development and the acquisition of the following learning outcomes:
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:
Students completing successfully this course will be able to
|
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
The goal of this course is to widen and deepen the programming knowledge acquired in preceding courses. This course will treat the following subjects:
- The course will give a uniform framework for all programming concepts, organised as programming paradigms.
- The course will give a formal semantics and reasoning techniques for all paradigms.
- Higher-order programming will be used as organising principle for the construction of procedural abstractions.
- Concurrent programming will be presented in its three principal forms, namely shared-state concurrency, message-passing concurrency, and deterministic dataflow concurrency.
- Data abstraction will be presented in its general form and with its two principal derived forms, namely object-oriented programming and abstract data types.
- Symbolic programming and algorithm design.
- Several programming paradigms will be presented in the course, including functional programming, object-oriented programming, deterministic dataflow programming, and multi-agent programming.
Teaching methods
- Weekly lectures
- Practical lab sessions in the computer room every week, to solve simplified problems using concepts explained during the lectures.
- One major design and programming project to apply these concepts to a more complex application
Evaluation methods
- Dispensatory test 25% (around week 7)
- Project 25%
- Final exam 50% (or 75% if redoing test part)
Other information
Prequisite:
- Second-year programming course Informatique 2 (LEPL1402) or equivalent.
Online resources
LINFO1104 Moodle.
Bibliography
Peter Van Roy et Seif Haridi, PROGRAMMATION: Concepts, techniques et modèles, Dunod, 2007
Peter Van Roy et Seif Haridi, Concepts, Techniques, and Models of Computer Programming, MIT Press, 2004
Peter Van Roy et Seif Haridi, Concepts, Techniques, and Models of Computer Programming, MIT Press, 2004
Teaching materials
- Concept, Techniques, and Models of Computer Programming
Faculty or entity
INFO
