Learning outcomes

At the end of the cursus, students should 

  • Use mathematical language in a correct manner, in order to propose models or to construct proofs,
  • Be able to develop analytic ability in first order logic, set and relation theory and boolean calculus,
  • Master algorithms used to express coding,
  • Be able to manipulate numerically different representations of numbers.

 

Content

This course builds on key concepts

  • Introduction to first order logic, set and relation theory
  • Boolean calculus  
  • Coding, and in particular linear coding
  • Representation of numbers

 

Assessment method

Written exam made of exercices to solve and proofs to be made.

The written assessment has two parts: A first determining part: questions which relate both to definitions and statements of theorems, as well as to calculation or short reflection exercises. This part is decisive, meaning that if the student obtains (for this first part) a grade less than or equal to 3,5/10 (or 7/20, or 35% of the points of the question), it will then be the final score (maximum 6/20) of the exam. A second (more important) part consists of exercises similar to those covered in tutorial sessions or during classes, as well as those proposed in the course. These exercises are the most important part of the exam. The student will have to demonstrate his understanding of the mathematical mechanisms used to solve the proposed exercises. Special care will be put on how  students explain their mathematical reasoning and deductions. Clarity and formalism are thus important. 

If the exam is done online (remote), an update of the proposed method may take place.

 

 

 

 

Sources, references and any support material

Many books in this area exist. To cite but only one, there is - R.P. Grimaldi. Discrete and combinatorial mathematics. An applied introduction. Fifth Edition. Pearson Eduction, 2004.

Language of instruction

Français
Training Study programme Block Credits Mandatory
Bachelor in Computer Science Standard 0 5
Bachelor in Computer Science Standard 1 5