At the end of this course, the student will be capable of carrying out the analysis of a particular problem and implement a solution to it in C. In order to achieve this, -he will determine the appropriate data structures. -Accordingly, he will decide which methods need to be implemented. -Finally, he will explain in a clear way his procedure of analysis and the usage of his program in the documentation
The objective of this course is to deepen the student's understanding of basic imperative programming.
This lecture aims at : -recalling data structures such as o Records, arrays, linked lists, -additionally introducing new ones such as o Stacks, queues, hash tables, and binary trees -presenting classical sorting procedures -illustrating these concepts using complete Pascal implementations -identifying compilation errors, as well as runtime or logical errors
The assessment consists of two stages. At first, the student prepares, either alone or in pairs, the analysis and implementation of different problems given during the year. Interested students will then have the opportunity to receive a first correction in order to improve the final version that will be evaluated.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C.Stein. Introduction à l'algorthimique, 2ème édition. Dunod, 2004.
| Training | Study programme | Block | Credits | Mandatory |
|---|---|---|---|---|
| Bachelor in Computer Science (shift schedule) | Standard | 0 | 10 | |
| Bachelor in Computer Science (shift schedule) | Standard | 1 | 10 |