<- Archives UCL - Programme d'études ->



Mathematics for computer science [ LSINF1250 ]


7.0 crédits ECTS  30.0 h + 15.0 h   2q 

Teacher(s) Avoine Gildas ;
Language French
Place
of the course
Louvain-la-Neuve
Main themes The basic themes are: - Elementary mathematical structures - Proof techniques - Enumeration - Algebraic structures - Graph theory - Analysis of complexity
Aims - To introduce the student to the mathematics used in computer science
Content The course is constructed around the following basic topics: - 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 Pre-requisites: Mathematics I and II (or equivalent) Evaluation: Test and Written exam Material: course notes
Cycle et année
d'étude
> Bachelor in Computer Science
> Bachelor in Mathematics
Faculty or entity
in charge
> INFO


<<< Page précédente