Mathematics for computer science
[SINF1250]
[30h + 15h] 7 credits
This course is taught in the 2d semester.
Teacher(s): Gildas Avoine
Language: French
Level: First
Aims
Main themes
- Elementary mathematical structures
- Proof techniques
- Enumeration
- Algebraic structures
- Graph theory
- Analysis of complexity
Content and teaching methods
- Mathematical structures: finite and infinite sets, relations, functions
- Proof techniques: induction, elementary logic
- Enumeration: binomial coefficients, recurrences, generating functions
- Algebraic structures: monoids, groups, morphisms, lattice, Boolean algebras
- Graph theory: trees, paths, matchings, tours
- Analysis of algorithms, plynomial algorithms, etc.
Other information (prerequisite, evaluation (assessment methods), course materials recommended readings, ...)
Mathematics I and II (or equivalent)
Evaluation: Test and Written exam
Material: course notes