Discrete wiskunde

Bekijk rooster Print deze pagina

Cursusdoel

The learning goal of the course is to become familiar with basic discrete structures (see content) and to be able to use them and to prove basic properties about them.

In terms of skills, we expect that students improve their ability to understand, evaluate and create proofs. Specifically, being able to use typical proof techniques for Discrete Mathematics.

Assessment
  • homework, (30% of the final grade)
  • two exams (70%)
  • tutorials multiple choice bonus (5%)
In the reflection, you should set your own smart goals and plan a working process. Later you are asked to evaluate and
potentially revise the process.

Prerequisites
We assume a foundational understanding of basic algorithms and elementary proof techniques, for example through the courses Logic and Datastructures.
Mathematics students usually adapt quickly and pick up the necessary algorithms along the way.
Computer Science students unfamiliar with simple proofs, like induction, shouldn't be deterred.
The course provides ample opportunities to grasp these essential skills, although a preliminary comfort level with them is beneficial for following the course more smoothly.

Vakinhoudelijk

The course follows very closely the book "Invitation to Discrete Mathematics" by Jiri Matousek and Jaroslav Nesetril.

The course covers five topics:
  • partial orders (chapter 2)
  • combinatirial counting (chapter 3)
  • graph theory (chapter 4)
  • trees (chapter 5)
  • planar graphs (chapter 6)
Course form
Lectures, tutorials, both in-person.
We will record the lectures if possible (it depends on the audiovisual equipment available on location).

Werkvormen

Hoorcollege

Werkcollege

Toetsing

Eindresultaat

Verplicht | Weging 100% | ECTS 7,5

Ingangseisen en voorkennis

Ingangseisen

Er is geen informatie over verplichte ingangseisen bekend.

Voorkennis

We assume a foundational understanding of basic algorithms and elementary proof techniques, for example through the courses Logic and Datastructures. Mathematics students usually adapt quickly and pick up the necessary algorithms along the way. Computer Science students unfamiliar with simple proofs, like induction, shouldn't be deterred. The course provides ample opportunities to grasp these essential skills, although a preliminary comfort level with them is beneficial for following the course

Voorkennis kan worden opgedaan met

INFODS INFOB1LI

Voertalen

  • Engels

Cursusmomenten

Gerelateerde studies

Tentamens

Er is geen tentamenrooster beschikbaar voor deze cursus

Verplicht materiaal

Er is geen informatie over de verplichte literatuur bekend


Aanbevolen materiaal

Materiaal Omschrijving
SOFTWARE Geen software nodig

Coördinator

L. Meijer MSc l.meijer2@uu.nl

Docenten

L. Meijer MSc l.meijer2@uu.nl
dr. J.A. Hoogeveen J.A.Hoogeveen@uu.nl

Inschrijving

Deze cursus is open voor bijvakkers. Controleer wel of er aanvullende ingangseisen gelden.

Inschrijving
Van maandag 4 november 2024 tot en met vrijdag 22 november 2024

Na-inschrijving
Van maandag 20 januari 2025 tot en met dinsdag 21 januari 2025

Inschrijving niet geopend
Permanente link naar de cursuspagina
Laat in de Cursus-Catalogus zien