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, TA/peergraded (40% of the final grade)
  • two exams (50%)
  • multiple choice questions during lecture and tutorials (10%)
  • reflection 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.

The exams contain 4 questions:
  • 2 knowledge questions that we will draw randomly at the beginning of the exam from a set that is given at the beginning of the course.
  • 2 creativity questions that we will create a day in advance.
You pick 3 out of the 4 questions to answer during the exam. You can look at all the knowledge questions using this link https://tinyurl.com/5hczb59n

Prerequisites
We assume a foundational understanding of basic algorithms and elementary proof techniques.
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).

The course uses in part TA/peer grading. The process is closely guided.

Guidance is given through several measures among them:
  • lecture on "how to give feedback''.
  • example grading done together during the tutorial
  • TA's going through all the homework again.
  • TA's discuss closely with instructor samples of every homework set
  • ample opportunity to discuss grades with the instructor.

Werkvormen

Hoorcollege

Werkcollege

Toetsing

Eindresultaat

Verplicht | Weging 100% | ECTS 7,5

Ingangseisen en voorkennis

Ingangseisen

Er is geen informatie over verplichte ingangseisen bekend.

Voorkennis

Er is geen informatie over benodigde voorkennis bekend.

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

dr. T. Miltzow T.Miltzow@uu.nl

Docenten

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

Inschrijving

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

Inschrijving
Van maandag 30 oktober 2023 tot en met vrijdag 24 november 2023

Na-inschrijving
Van maandag 22 januari 2024 tot en met dinsdag 23 januari 2024

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