IF25-12004
Discrete Mathematics
Description
This course prepares students to apply logic, sets, relations and functions in solving computational problems, apply combinatorics, graph theory and trees, and explain the basic concepts of discrete mathematics as a foundation of computer science. Study materials: Mathematical and Statistical Foundations (MSF).
Topics
- Logic, sets, relations and functions in solving computational problems
- Combinatorics, graph theory and trees
- Basic concepts of discrete mathematics as the foundation of computer science
Course Learning Outcomes (CLO)
Each course outcome derives from one programme outcome.
Supported PLOs
- CPL06
- Analyse and implement fundamental concepts of mathematics, statistics, algorithms and computer systems as the foundation of computing.
Previous curriculum equivalent
- IF2116 Matematika Diskrit · 4 credits · Kode, semester 3→2

