Forum Diskusi Materi Topik 11: Pohon (Bagian 1)

Open CourseWare Telkom University > Lessons > Forum Diskusi Materi Topik 11: Pohon (Bagian 1)
Course Content
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
11. Tree 1
00:00
11. Pohon 1
00:00
Online Quiz 11: Pohon (Bagian 1)
00:00
Forum Diskusi Materi Topik 11: Pohon (Bagian 1)
00:00
Binary tree data structure
00:00
Youtube video: introduction to tree
00:00
Some theorems pertaining to tree
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M1 – DEFINISI POHON
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M2 – DEFINISI HUTAN DAN SIFAT-SIFAT POHON
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M3 – DEFINISI POHON BERAKAR DAN PEMILIHAN AKAR
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M4 – TERMINOLOGI DASAR POHON BAGIAN 1
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M5 – TERMINOLOGI DASAR POHON BAGIAN 2
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M6 – TERMINOLOGI DASAR POHON BAGIAN 3
00:00
CII1G3-30294 – Matematika Diskrit – PB11 – M7 – POHON M-ARY
00:00
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
12. Tree 2
00:00
12. Pohon 2
00:00
Online Quiz 12: Pohon (Bagian 2)
00:00
Forum Diskusi Materi Topik 12: Pohon (Bagian 2)
00:00
Minimum spanning tree (explanation and source code, hackerearth.com, English version)
00:00
Minimum spanning tree (explanation and source code, hackerearth.com, Bahasa Indonesia version)
00:00
Youtube video: Prim’s algorithm
00:00
Youtube video: Kruskal’s algorithm
00:00
Tree traversal (from geeksforgeeks.org)
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M1 – DEFINISI POHON PERENTANG
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M2 – ALOGARITMA PRIM
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M3 – ALOGARITMA KRUSKAL
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M4 – TRAVERSAL PREORDER
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M5 – TRAVERSAL POSTORDER
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M6 – TRAVERSAL INORDER
00:00
CII1G3-30294 – Matematika Diskrit – PB12 – M7 – POHON URAI
00:00
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
13. Number Theory 1
00:00
13. Teori Bilangan 1
00:00
Online Quiz 13: Teori Bilangan Elementer (Bagian 1)
00:00
Forum Diskusi Materi Topik 13: Teori Bilangan Elementer (Bagian 1)
00:00
Several primality testing algorithm (from brilliant.org)
00:00
Khan academy: sieve of Eratothenes
00:00
Khan academy: introduction to number system
00:00
Youtube video (TedEd): a history of numerical system (by Alessandra King)
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M1 – DEFINISI KETERBAGIAN
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M2 – TEOREMA DAN SIFAT SIFAT KETERBAGIAN
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M3 – TEOREMA PEMBAGIAN
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M4 – BILANGAN PRIMA DAN ALOGARITMA UJI PRIMALITAS
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M5 – TEOREMA DASAR ARITMATIKA
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M6 – KONVERSI BILANGAN BINER OKTAL DAN HEKSADESIMAL KE SISTEM DESIMAL
00:00
CII1G3-30294 – Matematika Diskrit – PB13 – M7 – KONVERSI BILANGAN DESIMAL KE BILANGAN BINER OKTAL DAN HEKSADESIMAL
00:00
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
14.1. Number Theory 2
00:00
14.1. Teori Bilangan 2
00:00
14.2. Number Theory 3 (Supplementary)
00:00
14.2. Teori Bilangan 3 (Suplemen)
00:00
14.3. Number Theory 4 (Supplementary)
00:00
14.3. Teori Bilangan 4 (Suplemen)
00:00
Online Quiz 14: Teori Bilangan Elementer (Bagian 2)
00:00
Forum Diskusi Materi Topik 14: Teori Bilangan Elementer (Bagian 2)
00:00
Khan academy exercise: greatest common factor and least common multiple word problems
00:00
Euclidean algorithm (basic and extended, with source code)
00:00
Solving linear congruences
00:00
Modular arithmetic (by brilliant.org)
00:00
Chinese remainder theorem (from brilliant.org)
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M1 – gcd (FAKTOR PERSEKUTUAN TERBESAR, FPB)
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M2 – lcm (KELIPATAN PERSEKUTUAN TERKECIL, KPK)
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M3 – ALGORITMA EUCLID
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M4 – gcd SEBAGAI KOMBINASI LINIER
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M5 – ARITMETIKA MODULAR DAN TING Zm
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M6 – KONGRUENSI LINIER
00:00
CII1G3-30294 – Matematika Diskrit – PB14 – M7 – PENCARIAN INVERS MENGGUNAKAN ALGORITMA EUCLID
00:00
Menjelajahi Matematika Diskrit: Dari Pohon hingga Teori Bilangan Elementer dalam Dua Bagian

Forum Diskusi Materi Topik 11: Pohon (Bagian 1)

Discussion Forum for Topic 11: Tree (Part 1). You can ask for any material relating to topic 11 here.

 

 

Forum Diskusi Materi Topik 11: Pohon (Bagian 1). Anda dapat bertanya terkait materi yang diberikan di topik ini.
 
(There are no discussion topics yet in this forum)
Previous
Next
Secret Link