| PO | ||
| PO 05: Kemampuan menerapkan pengetahuan matematika, ilmu pengetahuan alam, bahasa, teknologi informasi, dan keteknikan untuk mendapatkan pemahaman menyeluruh tentang prinsip-prinsip teknik informatika.
PO 09: Kemampuan mendesain dan melaksanakan eksperimen laboratorium dan/atau lapangan serta menganalisis dan mengartikan data untuk memperkuat penilaian dalam bidang informatika. PO 10: Kemampuan mengidentifikasi, merumuskan, menganalisis, dan menyelesaikan permasalahan dalam bidang informatika. PO 11: Kemampuan menerapkan metode, ketrampilan, dan/atau piranti teknik informatika yang terbaru yang diperlukan untuk praktek bidang informatika. |
||
| CLO | ||
| CLO 1: the students have the ability to identify the characteristics of relation, function, and recurrence relation and apply rigorous technique for solving mathematical problem pertaining to such materials.
CLO 2: the students have the ability to identify elementary combinatorial problems and utilize appropriate mathematical methods for solving such problems. CLO 3: the students have the ability to identify the characteristics of graphs and trees as well as demonstrating the process of several algorithms pertaining to such structures. CLO 4: the students have the ability to perform elementary calculation pertaining to elementary number theory, such as computing the greatest common divisor, least common multiple, and performing elementary modular arithmetic. |
||
| Discrete Mathematics – A provides a rigorous exposure concerning discrete structure and their relevant properties for computer science. This course supports the discrete structure materials used in data structure and other relevant foundations in algorithms. There are four main topics in this course which correspond to four course learning outcome. The first topic discusses relation, function, and simple homogenous recurrence relation. The students will learn the definition of relation and function as well as their representation and mathematical characteristics. The second topic is pertaining to combinatorial mathematics. The student will study the basic counting principle, permutations and combinations, as well as their generalization. The third topic is about graph and tree. In this topic the students will be exposed to the formal definition of graph, some properties of graphs, and some elementary graph algorithm (for path finding and graph coloring). Finally, in the last topic the students will learn elementary number theory, which contains the discussion about divisibility, greatest common divisor and least common multiple, and elementary modular arithmetic. | ||
| Materi | ||