Learning outcomes
By the end of the course students will have a basic understanding of the imperative programming paradigm, and they will be able to write small programs in the C language.
Objectives
The goal of IHDC B131 is to introduce the students to the basic concepts of algorithmics and imperative programming, and to familiarise them with a rigourous approach for the construction of (small) programs.
Content
After introducing the key concepts behind the concepts of algorithms and programs, we study the basic elements of imperative programming: variable assignment and control structures (sequence, selection, and iteration). We pay attention to the formal reasoning underlying programming in particular for the construction of loops (the invariant method) and the creation of computation by iteration. We study the use sub-programs including parameter passing (by value and by reference) and emphasize their use for structuring a program. We study the use of tables and structures and introduce some key notions of algorithmics and complexity. The programming language used in this course is C, although the concepts discussed and the methodology to be acquired are independent of a particular language.
Table of contents
The contents of the course is divided in 6 units:
-
Introducing the notions of algorithm and program
-
Basic elements of C programming
-
Computing by iteration
-
Functions being the essential components of a program
-
Data structures
-
Introduction to algorithmics
Teaching methods
Lectures (ex-cathedra) are accompanied by guided exercise sessions. Before each exercise session, the students are asked to prepare a series of introductory exercises, registered into their personal portfolio, that will be completed with exercises resolved during the session. Students will submit some of their exercises - in paticular those made during the session - to Webcampus. Students will participate in a peer reviewing process in which they evaluate the exercises of their fellow students.
Evaluations
Students are evaluated during the semester based on their personal exercises portfolio and, in partiuclar, on the exercises that are realised during the guided exercise sessions and submitted to Webcampus.
Recommended readings
A course syllabus is available (in french); W. Vanhoof, Introduction à la programmation. Université de Namur, 194 pages.
The slides used during the course are available on Webcampus.
Some other references that could be used but that go beyond what is seen in the course:
-
M. Sprankle, Problem solving and programming concepts, 2006 Pearson education.
-
Tim Bailey, An Introduction to the C programming language and Software design.
-
N. Dale and C. Weems. Programming and problem solving with C. Jones & Bartlett
-
Kernighan, B.W. and Ritchie, D.M. Le langage C (ANSI). Dunod 2005
Language of instruction
French / Français
Location for course
NAMUR
Organizer
Faculté d'informatique
rue Grandgagnage 21
5000 NAMUR
P. 081725252
F. 081724967
secretariat.info@unamur.be
Degree of Reference
Undergraduate Degree