CS-101 / 7 crédits

Enseignant: Käser Jacober Tanja Christina

Langue: Anglais

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.

## Keywords

Propositional logic, counting, complexity, big-O, number representations, sets, functions, relations, induction, basic probabilities, Bayes theorem, combinatorial analysis, recurrences, countability.

## 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
• 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

Continuous evaluations 10% and final exam 90%

## Supervision

 Office hours No Assistants Yes Forum No Others Additional Q&A sessions will take place on Tuesdays from 17:15-18:30 in INM 10 (starting in the second week of the semester)

## 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.)

## Dans les plans d'études

• Semestre: Automne
• Forme de l'examen: Ecrit (session d'hiver)
• Matière examinée: Advanced information, computation, communication I
• Cours: 4 Heure(s) hebdo x 14 semaines
• Exercices: 2 Heure(s) hebdo x 14 semaines
• Semestre: Automne
• Forme de l'examen: Ecrit (session d'hiver)
• Matière examinée: Advanced information, computation, communication I
• Cours: 4 Heure(s) hebdo x 14 semaines
• Exercices: 2 Heure(s) hebdo x 14 semaines
• Semestre: Automne
• Forme de l'examen: Ecrit (session d'hiver)
• Matière examinée: Advanced information, computation, communication I
• Cours: 4 Heure(s) hebdo x 14 semaines
• Exercices: 2 Heure(s) hebdo x 14 semaines

## Semaine de référence

 Lu Ma Me Je Ve 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

## Cours connexes

Résultats de graphsearch.epfl.ch.