Saint-Louis University - Bruxelles
|

ECGE1230 - Computer science II


USL-B


Credits : 4

Lecturer :
Teaching assistants :
Mode of delivery :
Face-to-face , second term, 30 hours of theory and 30 hours of exercises.

Timetable :
Second term
Tuesday from 10:45 to 12:45 at 109 Marais 300

Language of instruction :
French

Learning outcomes :
The course contains in two closely related parts (i.e. introduction to the application of algorithms using a programming language, and an introduction to object-oriented programming). The first part focuses on procedural programming, which useful in the development of mathematical models and (statistical) data processing. This processing part is closely related to web technologies and allows teaching an introduction to web technologies in the context of the course.

The introduction to algorithms aims at training students in the search for solutions adapted to a set of specifications. Unlike other courses, the goal is not to apply a technique to find the answer but to develop this technique (we do not seek the answer but how to find the answer for the user). Emphasis is also placed on the study of algorithms and instruction sequences (simple instruction, sequential flow, repetition, conditional). By writing algorithms, students learn to explain/communicate their reasoning step by step. Expressing ideas avoiding ambiguity is an essential skill for every student and a methodological support for the other courses.

The introduction to a programming language aspect aims to introduce students to a programming language. By learning a programming language, students have a tool to test their algorithms, which gives them immediate feedback. The skills acquired in this course are especially useful for students who will need to write algorithms themselves in their master's degree, e.g. when processing data in SPSS, SAS or R, using mathematical software (e.g. MatLab).

The introduction to object-oriented programming teaches students to organize their thoughts when designing an application. At the same time they learn the vocabulary of a computer scientist which should enable them to understand the needs and requirements of a computer scientist and to communicate their needs and requirements to a computer scientist as well as to evaluate the quality of a computer scientist's work.



Prerequisites :
None

Co-requisites :
None

Course contents :
• Algorithmics
• Procedural programming
• Object Oriented programming
• Treatment of (web) data
• Applied Statistics and Mathematics


Planned learning activities and teaching methods :
Face-to-face,
• 30 hours of theory
• 30 hours of exercices
Ex cathedra presentations
Computers are used for tutorials



Assessment methods and criteria :
The summative assessment is a written closed-book examination of three hours.

The questions will mix fairly basic aspects (e.g., interpretation/understanding/evaluation of code), concepts seen in the course, and practical questions of data structure development, algorithm development, and production of a program meeting a given specification.





Recommended or required reading :
Apprendre à programmer avec Python 3, Gérard Swinnen, Eyrolles 2011, ISBN 978-2-212-12708-9

Other information :
The textbook is available online http://inforef.be/swi/download/apprendre_python3.pdf