URL study guide
https://tue.osiris-student.nl/onderwijscatalogus/extern/cursus?cursuscode=JBI026&collegejaar=2025&taal=enOmschrijving
IMPORTANT: For this course we will ONLY offer exam opportunities. In 2026-2027 and onward no exam opportunities are possible anymore. The resit opportunities are only available to students who have previously taken this course. There will be NO lectures or tutorials. The final grade consists entirely of one test; interim test results from previous years will not be included.Many aspects of Data Science rely on computers to do the heavy lifting for handling data, computing results, running simulations, etc. To effectively use the computer as a tool, we will cover basic discrete mathematical structures that occur in many contexts in computer science and data science. You will learn the basic skills and knowledge of logic to formally reason about these structures, including relations, orderings, graphs (networks) and trees.
Doelstellingen
IMPORTANT: For this course we will ONLY offer exam opportunities. In 2026-2027 and onward no exam opportunities are possible anymore. The resit opportunities are only available to students who have previously taken this course. There will be NO lectures or tutorials. The final grade consists entirely of one test; interim test results from previous years will not be included.At the end of the course you can...
• apply basic terms and concepts of logic and set theory in reasoning and proving.
• use basic proving techniques (e.g.,direct proof, proof by contradiction, induction).
• identify and prove properties of functions and relations (e.g. injection, surjection, symmetry, transitivity, reflexivity, etc.)
• apply the basics of combinatorics and counting (e.g., number of binary strings of given length, number of subsets of a set, number of permutations of a set).
• reason about the basic definitions and concepts of graph theory.
• identify various properties and substructures in graphs (e.g., Euler tours, Hamiltonian Cycles, 2-connectivity).
• reason about properties of rooted trees (e.g., height, depth, size of (un)balanced binary trees).