Introduction to computer programming

Duration

12h Th, 12h Pr

Number of credits

Lecturer

Benoît Donnet, Raphaël Fonteneau

Language(s) of instruction

French language

Organisation and examination

Teaching in the first semester, review in January

Units courses prerequisite and corequisite

Prerequisite or corequisite units are presented within each program

Learning unit contents

The course alternates between notions related to the C language and to algorithmic patterns. The main themes tackled are the following: basic syntax and semantic of the C language, simple algorithms (linear run of an array, cumulative mathematical operations), dividing a problem into sub-problems, basic data structures (record, array, string, files) and program modularity (procedure/function, global variable). The structure of the course is as follows:

• Introduction
• Chapiter 1: Block, Variables, Simple Instructions
• Chapter 2: Control Statements
• Chapter 3: Data Structures
• Chapter 4: Code Modularity

Learning outcomes of the learning unit

The objective of the course is to introduce, to students, basic principles of computer science and, in particular, computer programming in order to facilitate the follow up of their studies and career.
In this course, we focus on the code strictness and on the sub-problem approach. At the end of the semester, the student will be able to provide the C code for a mid-size problem.

Prerequisite knowledge and skills

Nothing wrt computer science or programming.
However, the course assumes a good knowledge of French (spoken and written)

Planned learning activities and teaching methods

The course will alternate theoretical lessons (with slides) and exercises lessons. The course will be made of 6 theoretical lessons and 6 exercises lessons. Depending on the algorithmic laboratory availability, a lesson in front of computers could be possibly organized during the semester.

Mode of delivery (face-to-face ; distance-learning)

The course is given during the first semester and is based on slides.
The theoretical lessons are built around examples and small exercises. The class is supposed to actively participate during the lessons.

Recommended or required readings

Slides for the lessons are available, in a printed format, at the Centrale des Cours. An electronic version (PDF) is also available on the course web page. An exercises collection (with partial corrections) is also available at the Centrale des Cours. Again, an electronic version (PDF) is available on the course web page. Students are supposed to own, as quickly as possible, the slides and exercices collection. None book is mandatory. However, for students willing to go further, those books (in French) are interesting:

• Claude Delannoy. "Programmer en C". Editions Eyrolles. 2010 (5ème édition)
• Rémi Malgouyres, Rita Zrour, Fabien Feschet. "Initiation à l'Algorithmique et à la Programmation en C". Editions Dunod. 2011 (2ème édition).
• Yves Granjon. "Algorithmes en Pascal et en Langage C". Editions Dunod. 2004 (2ème édition).

Assessment methods and criteria

A written exam is organized in January. It lasts between 2 and 3 hours and covers the whole material seen during the semester. The exam is only made of exercises. It is a kind of case study, with various small problems students have to solve. Students cannot look at their class notes during the exam. The resit exam has the same format as the one in January. In order to carefully prepare the exam, it is highly recommended to do a maximum of exercises from the collection and to discuss those exercises with the Teacher.

Work placement(s)

Organizational remarks

The course is given during the first semester

Contacts

Teacher: Raphaël Fonteneau (email(raphael.fonteneau@ulg.ac.be) - Office2.100 (B28) Responsible: Benoit Donnet ()email(benoit.donnet@ulg.ac.be) - Office 1.15 (B28))

Items online