Uw huidige browser heeft updates nodig. Zolang u niet update zullen bepaalde functionaliteiten op de website niet beschikbaar zijn.
Let op: het geselecteerde rooster heeft overlappende bijeenkomsten.
Volgens onze gegevens heb je nog geen vakken behaald.
Je planning is nog niet opgeslagen
Let op! Uw planning heeft vakken in dezelfde periode met overlappend timeslot
Discrete wiskunde
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
potentially revise the process.
The exams contain 4 questions:
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.
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%)
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.
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:
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.
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:
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
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
- Gametechnologie vanaf 2015-2016
- Gametechnologie vanaf 2023-2024
- Informatica en Informatiekunde vanaf 2023-2024
- Informatica en Informatiekunde vanaf 2024-2025
- Informatica en wiskunde vanaf 2019-2020
- Informatica en wiskunde vanaf 2022-2023
- Informatica en wiskunde vanaf 2024-2025
- Informatica vanaf 2023-2024
- Informatica vanaf 2024-2025
- Informatica voor 2019-2020
- Minor Wiskunde
- Natuurkunde en Wiskunde 2023-2024
- Natuurkunde en wiskunde vanaf 2019-2020
- Natuurkunde en wiskunde vanaf 2020-2021
- Natuurkunde en Wiskunde vanaf 2024-2025
- Wiskunde en Economie vanaf 2022-2023
- Wiskunde en Economie vanaf 2024-2025
- Wiskunde en toepassingen vanaf 2019-2020
- Wiskunde en toepassingen vanaf 2022-2023
- Wiskunde en toepassingen vanaf 2024-2025
- Wiskunde vanaf 2019-2020
- Wiskunde vanaf 2022-2023
- Wiskunde vanaf 2024-2025
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
Onbekend | - |
Docenten
Onbekend | - |
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