Algorithmic and C programming - 3AMCS357

Number of hours
- Lectures 9.0
- Projects -
- Tutorials 10.5
- Internship -
- Laboratory works -
- Written tests -
ECTS
ECTS 3.0

Goal(s)

Be able to design a simple algorithm, according to the schemes studied in class, including control structures and manipulating simple data structures (stacks, queues, lists).
To be able to implement an algorithm in C language using the fundamental concepts of the language (including pointers).

Responsible(s)

Jean-Luc KONING

Content(s)

Design of simple algorithms
- Expressions and types
- Instructions, assignment
- Control instructions
- Procedures and functions; parameter passing types
Simple data structures
- Tables, items
- Stacks, queues, lists
Pointers
- Notion of address
- Use in the case of linked lists

Practical work
- Realization of programs in C illustrating the aspects of the course
- Programming project (to be deepened according to the level reached).

Test

CC: 1 or more Continuous Tests on the lecture and the TD (document not allowed, without calculator)
E1: Examination of session 1 : Written 1h30, document not allowed, without calculator
Practical work: 1 or more graded practical work
E2: Examination of session 2 : Oral 1h or Written 1h30, document not allowed, without calculator
ExTP :

In case of confinement (even partial), the final exam is likely to be cancelled. In this case, only the CC and TP marks will be taken into account for session 1.

In case of absence (justified) at the CC, the weight of the mark is transferred to the final exam (except in case of confinement). In a confinement situation, and in case of justified absence at the CC, an oral evaluation will be done.

Calendar

The course exists in the following branches: