CS-101 / 7 credits

Teacher: Aberer Karl

Language: English

Remark: This course focuses on the foundational, discrete mathematics core of advanced computation.


Summary

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, discrete structures & algorithmic thinking.

Content

Keywords

Propositional logic, counting, complexity, big-O, number representations, sets, matrices, modular arithmetic, induction, basic probabilities, Bayes theorem, combinatorial analysis, recurrences, generating functions, countability, graph theory.

Learning Outcomes

By the end of the course, the student must be able to:

  • Recognize if there is a mistake in a (simple) proof
  • Apply general problem-solving techniques
  • Recognize the mathematical structures present in applications
  • Apply simple recursion and use it to design recursive algorithms
  • Apply the tools studied in class to solve problems
  • Demonstrate familiarity with mathematical reasoning
  • Solve linear recurrences and use generating functions
  • Argue about (un)countability
  • Formulate complete, clear mathematical proofs

Transversal skills

  • Assess one's own level of skill acquisition, and plan their on-going learning goals.
  • Continue to work through difficulties or initial failure to find optimal solutions.
  • Demonstrate the capacity for critical thinking

Teaching methods

Ex cathedra lectures

Expected student activities

Studying the book, test your understanding by making the exercises, ask questions

Assessment methods

Final exam (100%), mostly (and possibly exclusively) multiple choice

Supervision

Office hours No
Assistants Yes
Forum No
Others

Resources

Bibliography

"Discrete Mathematics and Its Applications", Kenneth H. Rosen, 8th ed, McGraw-Hill 2019. (You should be able to find the pdf on the web.)

Ressources en bibliothèque

Websites

Moodle Link

In the programs

  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Advanced information, computation, communication I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Advanced information, computation, communication I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Advanced information, computation, communication I
  • Lecture: 4 Hour(s) per week x 14 weeks
  • Exercises: 2 Hour(s) per week x 14 weeks

Reference week

 MoTuWeThFr
8-9     
9-10     
10-11     
11-12     
12-13     
13-14     
14-15     
15-16     
16-17     
17-18     
18-19     
19-20     
20-21     
21-22