 | | |
| INFO2009-1 | Introduction to computer science
|
|
| Duration : | 25h Th, 20h Pr |
|
| Number of credits : |
|
|
| Lecturer : | Benoît Donnet |
|
Language(s) of instruction :
|
| French language |
|
Organisation and examination :
|
| Teaching in the first semester, review in January |
|
Course contents :
|
| The course alternates between aspects of the C language and algorithmic.
The lessons topics are the following: syntax and semantic of the C language, simple algorithms, problem division into sub-problems, program correction and complexity, complex data structures (structure, arrays, strings, files, enum), modularity (function, procedure, global variable), specification, dynamic memory allocation mechanism (pointers), dynamic data structures (linked list, double linked list) |
|
Learning outcomes of the course :
|
| The objective of the course is to introduce students to basics principles of computer science and, in particular, principles of programming
The conception of an algorithm that is correct and efficient is at the heart of the course, as well as a rigorous development methodology (i.e., dividing a complex problem into smaller sub-problems that are easier to solve, invariant and documenting the code with specifications).
The programming language studied is C |
|
Prerequisites and co-requisites/ Recommended optional programme components :
|
| None. |
|
Planned learning activities and teaching methods :
|
| In addition to theoretical lessons, exercises (mandatory) sessions are organized. Each exercises session lasts 2h. Each student will have 5-6 sessions during the semester.
Further, mandatory laboratory sessions (i.e., exercises in front of computers) of 2h are also weekly organized. Those sessions start, usually, in mid-october. Each student should have 5-6 laboratory sessions |
|
Mode of delivery (face-to-face ; distance-learning) :
|
| The course is given on the first semester.
The theoretical lessons are based around examples and small exercises. Students are supposed to actively participate during lessons. |
|
Recommended or required readings :
|
| Slides are made available, in a printed form, by the Centrale des Cours. An electronical version (in PDF) is also available on the course web page.
An exercises document (with a partial correction) is also made available by the Centrale des Cours. Again, an electronic version (in PDF) is also available on the course web page.
Student are supposed to have slides and exercises document as quickly as possible.
No book is mandatory. However, interested students may refer to the following books (they were used for preparing lessons):
- Claude Delannoy. "Programmer en Langage C". Editions Eyrolles. 2010 (5ème édition).
- Rémy 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 :
|
| Students are evaluated in three ways:
- MCQ. a short test (typically a MCQ), mandatory, is organized in the beginning of each exercises session. This test should, normally, force students to prepare each exercises sessions. The sum of all MCQ tests will count for 10% in the final grade.
- mid-term test. A written test is organized in the middle of the semester. This test will be about lessons seen at that time, typically basics of C, sub-problems division, invariant, algorithm complexity. This test is mandatory and will count for 10% in the final grade.
- Exam. A written exam is organized in January. It lasts 4h and covers all the material seen during the lessons (the course web site proposes an example of a previous exam). The exam is made of understanding/discussion questions and exercises (in the same style as those proposed during exercises and laboratory sessions). The exam will count for 80% of the final grade.
In order to be best prepared for the exam, it is highly recommended to practice a lot with the exercises document and discuss those exercises with the pedagogical team (teacher and/or TA).
In case of failure in January, the grades for the MCQs and/or the written test can be maintained for the resit (in June and/or in August) only if it is in favor of the student. |
|
Training(s) :
|
| |
|
Organizational remarks :
|
| A WWW page with up-to-date information about the course is available at the URL http://www.montefiore.ulg.ac.be/~bdonnet/info2009/index.html |
|
Contacts :
|
| Teacher: Benoit Donnet, benoit.donnet@ulg.ac.be(boigelot@montefiore.ulg.ac.be
Assistants: )The pedagogical team will be available, during the semester, according to a given agenda. |
|
