Discrete Structures (IBC018)

Welcome!

On this page you can find information about the course Discrete Structures which is part of the Pre-master Computing and Information Sciences.

For formal information, please go to IBC018 in the study guide.

This course is not really a course on its own, but it consists of two parts. The first part is borrowed from the course Formal Reasoning (IPK001) and the second part is borrowed from the course Combinatorics (IBC016). Topics that will be discussed:

- Formal Reasoning: chapter 4, Discrete Mathematics
- Graph theory
- Recursion
- Induction

- Combinatorics: section 8.1, Deriving recurrence relations
- Combinatorics: section 8.2, Solving recurrence relations
- Computer assignment, probably in Maple

On this small site you can find refereces to the literature for this course and our weekly schedule.

Goals

After completing the course you are able to:

- reproduce and apply basic notions of graph theory,
- compute and apply binomial coefficients,
- define recursive functions,
- prove basic theorems using mathematical induction,
- derive closed formulas for given recurrence relations.