Discrete Mathematics
Course Code
IF1220
Number of Credits
3
Semester
Course Type
Related Courses
| No | Code | Course | Relation |
|---|---|---|---|
| 1 | IF2120 | Discrete Mathematics | Equivalent |
Study Material
| Study Material | Depth |
|---|---|
| CS-DS-4. Basics of Counting | Expert |
| CS-DS-1. Sets, Relations, and Functions | Expert |
| CS-DS-3. Proof Techniques | Expert |
| CS-IAS-6. Cryptography - Asymmetric, Symmetric Cryptography, HMAC, PKI | Expert |
| CS-DS-5. Graphs and Trees | Expert |
Graduate Learning Outcomes (GLO) carried by the course
| CPMK Code | Course Learning Outcomes Elements (CLO) |
|---|---|
| CPMK 1 | Explain major discrete structures such as sets, relations, permutations and combinations, graphs, and trees |
| CPMK 2 | Formulate problem models using theories in discrete mathematics |
| CPMK 3 | Evaluate and analyze problem solutions using theories in discrete mathematics |
| CPMK 4 | Perform algorithm complexity analysis using time complexity and express it in asymptotic complexity notation |
Learning Method
- Lectures, Case studies, Problem-based Learning, Literature studies
Learning Modality
- Offline (Luring); Synchronous/Asynchronous; Independent/Group
Assessment Methods
- Midterm Exam (UTS), Final Exam (UAS), Quizzes, Paper Assignments