About Lesson
Topic 11: Tree Part 1 (Topik 11: Pohon Bagian 1)
RootedTrees
EN: Welcome to Topic 11 about Tree Part 1. After completing this topic you are expected to know:
LO-01: the definition of a tree, forest, and related elementary theorems.
LO-02: the definition of rooted tree, tree-related terminology (such as parents, child, degree, level, height, and more advanced terminology such as m-ary tree, regular tree, and balanced tree).
LO-03: some basic properties of a rooted tree.
ID: Selamat datang di Topik 11 mengenai Pohon Bagian 1. Setelah menyelesaikan topik ini, Anda diharapkan menguasai capaian berikut:
LO-01: memahami definisi pohon, hutan, dan teorema-teorema dasar terkait.
LO-02: memahami definisi pohon berakar, terminology terkait pohon (contohnya orangtua, anak, derajat, tingkat, dan ketinggian, dan terminology lanjut seperti pohon m-ary, pohon regular, dan pohon seimbang).
LO-03: memahami sifat-sifat dasar terkait pohon berarakar.
0/14
Topic 12: Tree Part 2 (Topik 12: Pohon Bagian 2)
EN: Welcome to Topic 12 about Tree Part 2. After completing this topic you are expected to know:
LO-01: the definition of a spanning tree of a graph and minimum spanning tree of a weighted graph.
LO-02: procedures to determine the minimum spanning tree of a weighted graph using Prim and Kruskal algorithm.
LO-03: the definition of tree traversal and its types, namely preorder traversal, postorder traversal, and inorder traversal (supplementary).
LO-04: some tree applications for parse tree and decision tree (supplementary).
ID: Selamat datang di Topik 12 mengenai Pohon Bagian 2. Setelah menyelesaikan topik ini, Anda diharapkan menguasai capaian berikut:
LO-01: mengetahui definisi pohon perentang (spanning tree) dari suatu graf dan pohon perentang minimum (minimum spanning tree) dari suatu graf berbobot.
LO-02: mampu menentukan pohon perentang minimum (minimum spanning tree) dari suatu graf berbobot menggunakan Algoritma Prim dan Kruskal.
LO-03: mengetahui definisi traversal pada pohon dan jenis-jenisnya, yaitu traversal preorder, postorder, dan inorder (materi suplemen).
LO-04: mengetahui penerapan pohon untuk pohon urai (parse tree) dan pohon keputusan (decision tree) (materi suplemen).
0/16
Topic 13: Elementary Number Theory Part 1 (Topik 13: Teori Bilangan Elementer Bagian 1)
EN: Welcome to Topic 13 about Number Theory Part 1. After completing this topic, you are expected to:
LO-01: understand division theorem and its application for calculating mod and div.
LO-02: know the definition of prime numbers and composite numbers, elementary methods for prime factorization, and elementary algorithm for primality testing.
LO-03: know the representation of an integer in specific bases, particularly base 2 (binary), base 8 (octal), and base 16 (hexadecimal).
ID: Selamat datang di Topik 13 mengenai Teori Bilangan Bagian 1. Setelah menyelesaikan topik ini, Anda diharapkan menguasai capaian berikut:
LO-01: mengetahui teorema keterbagian dan penerapannya untuk menghitung fungsi mod dan div.
LO-02: mengetahui definisi bilangan prima, bilangan komposit, faktorisasi prima, dan algoritma untuk memeriksa primalitas bilangan.
LO-03: merepresentasikan bilangan bulat dalam basis tertentu, terutama basis 2 (biner), basis 8 (oktal), dan basis 16 (heksadesimal).
0/15
Topic 14: Elementary Number Theory Part 2 (Topik 14: Teori Bilangan Elementer Bagian 2)
EN: Welcome to Topic 14 about Number Theory Part 2. After completing this topic, you are expected to know:
LO-01: the definition of gcd and lcm as well as their calculation using the prime factorization method.
LO-02: how to implement Euclid algorithm to find gcd of several numbers.
LO-03: the definition of simple linear congruences.
LO-04: the procedure to solve simple linear congruences.
LO-05: som applications of number theory, namely problem solving using Chinese Remainder Theorem and mathematical model in Diffie-Hellman Key Exchange (supplementary).
ID: Selamat datang di Topik 14 mengenai Teori Bilangan Bagian 2. Setelah menyelesaikan topik ini, Anda diharapkan menguasai capaian berikut:
LO-01: mengetahui definisi gcd dan lcm serta kalkulasinya menggunakan faktorisasi prima
LO-02: mampu menerapkan algoritma Euclid untuk menghitung gcd dari beberapa bilangan.
LO-03: mengetahui definisi kongruensi linier sederhana.
LO-04: mampu mencari solusi dari kongruensi linier sederhana.
LO-05: mengetahui penerapan teori bilangan, yaitu penyelesaian masalah dengan Chinese Remainder Theorem dan model masalah matematis pada Diffie-Hellman Key Exchange (suplemen).
0/20