If the colour codes change during the academic year to orange or red, modifications are possible, for example to the teaching and evaluation methods.

Course Code : | 1000WETDWI |

Study domain: | Mathematics |

Academic year: | 2020-2021 |

Semester: | 2nd semester |

Contact hours: | 30 |

Credits: | 3 |

Study load (hours): | 84 |

Contract restrictions: | No contract restriction |

Language of instruction: | Dutch |

Exam period: | exam in the 2nd semester |

Lecturer(s) | Stijn Symens |

At the start of this course the student should have acquired the following competences:

an active knowledge of

an active knowledge of

- Dutch

- general knowledge of the use of a PC and the Internet

- A student can reduce combinatorial problems to a mathematical context.
- A student can solve combinatorial problems by use of generating functions. moreover, a student can convert a recursive definition of a sequence into a closed formula by use of generating functions.
- A student can translate practical problems to a graph theoretical context and solve them by the given algorithms.

- elementary combinatorics:
- counting principles
- binomial theorems

- generating functions
- counting principles
- recursive defined sequences

- graph theoy:
- introduction
- Euler graphs
- Hamiltonian graphs
- Plane graphs and graph coloring

Class contact teachingLectures Practice sessions

Personal workExercises Assignments Individually

**5.3 Facilities for working students ***

Others

Personal work

Others

Written assessment can be uploaded via Blackboard.

ExaminationWritten examination without oral presentation Closed book Multiple-choice Open-question

Course notes can be found at universitas.

Stijn Symens, stijn.symens@uantwerpen.be