Skip to main content
Desain dan Analisis Algoritma
0%
Focus Mode is ON. Click ‘X’ at right bottom to close it.
Previous
Course data
General
Pengumuman
Introduction to Design and Analysis Algorithm
01 Fundamental of Algorithm Analysis v4 - (Presensi)
Fundamental of Algorithm Analysis
Basic Efficiency Class - Part 01
Basic Efficiency Class - Part 02
Basic Efficiency Class - Part 03
Tugas: Basic Efficiency Class (Kelas A)
Tugas: Basic Efficiency Class (Kelas B)
19 September - Bonus Mahasiswa
Analysis of Non-Recursive Algorithm
02 Matematical Analysis of non recursive algorithm v.1.00 (Presensi))
Basic Non Rekursive Algorithm Analysis ( Presensi ) Kelas A
Basic Non Rekursive Algorithm Analysis ( Presensi ) Kelas B
Analisis - Pendekatan Matematis dari Basic Non Recursive Algorithm - Kelas A
Analisis - Pendekatan Matematis dari Basic Non Recursive Algorithm - Kelas B
Kuliah DAA - Senin 25 April 2022
02 Mathematical Analysis of Non Recursive Algorithm
Bubble Sort and Insertion Sort
Selection Sort
Penjabaran Analysis Non Recursive Algorithm
Analysis of Recursive Algorithm
03 Matematical Analysis of Recursive algorithm v.1.02 - (Presensi)
02 Matematical Analysis of Recursive Algorithm
Tower of Hanoi 02
Tower of Hanoi Bagian 01
Binary Representation
Basic Analysis of Recursive Algorithm ( Presensi ) Kelas A
Basic Analysis of Recursive Algorithm ( Presensi ) Kelas B
Basic Analysis of Recursive Algorithm ( Presensi )Kelas A - Essay
Basic Analysis of Recursive Algorithm ( Presensi )Kelas B - Essay
04: Dynamic Programming ( Knapsack Problem )
04 Dynamic Programming
Dynamic Programming - Part 01
Dynamic Programming : Part 02
Implementation of Dynamic Programming ( Presensi ) - Kelas A
Implementation of Dynamic Programming ( Presensi ) Kelas B
05: Dynamic Programming ( Optimal Binary Search Tree )
05 Dynamic Programming II Optimal Binary Search Tree
Dynamic Programming: Optimal Binary Search Tree - Part 01
Dynamic Programming: Optimal Binary Search Tree - Part 02
Dynamic Programming Optimal Binary Search Tree - Kelas A
Dynamic Programming Optimal Binary Search Tree - Kelas B
06: Dynamic Programming ( Warshal Floyd Algorithm )
06 Dynamic Programming Warshall Floyd Algorithm
07: Decrease and Conquer
Decrease and Conquer v3 - Presensi
Decrease and Conquer
Decrease and Conquer Implementation [ Kelas A ]
Decrease and Conquer Implementation [ Kelas B ]
08: Brute Force and Exhautive Search
Brute Force and Exhautive Search v4
Brute Force dan Exhautive Search
9. Hungarian Method for Assignment Problem
10 Hungarian Method for Assigment Problems.1.00 (1) - Presensi
Hungarian Method Assigment Problems
[PRESENSI] Hungarian Method for Assignment Problem - Kelas A
[PRESENSI] Hungarian Method for Assignment Problem - Kelas B
Pengumpulan Berkas Kuis Hungarian Method for Assigment Problem - [Kelas A]
Pengumpulan Berkas Kuis Hungarian Method for Assigment Problem - [Kelas B]
10: Transform and Conquer - Self Study
Transform and Conquer(2)
Branch and Bound
11 Branch And Bound.1.10
Branch and Bound State Representation
12. Job Problem Using Branch and Bound
12 Job Problem Using Branch and Bound.1.00
Job Sequence Branch and Bound
13. Knapsack Using Branch and Bound
13 Knapsack Using Branch and Bound.1.00
Knapsack Problem - Branch and Bound
14. Quiz I
Quiz UTS
UAS - 14 Januari 2023
UAS 14 Januari 2023
Pengumpulan Berkas UAS - 15 Januari
Next
Side panel
Categories
All categories
Fakultas Teknologi Informasi
2023/2024 Antara - Teknik Informatika
2023/2024 Ganjil Teknik Informatika
SP Khusus
2023/2024 Ganjil - Perpustakaan dan Sains Informasi
2023/2024 Genap - Perpustakaan dan Sains Informasi
2023/2024 Genap Teknik Informatika
2024/2025 Ganjil - Perpustakaan dan Sains Informasi
2024/2025 Ganjil - Teknik Informatika
Trek Kecerdasan buatan
Trek Pengembangan Aplikasi Multiplatform
Trek Pengembangan Internet Of Thing
Arsip
2019/2020 Antara - Teknik Informatika
2019/2020 Ganjil - Perpustakaan dan Sains Informasi
2019/2020 Ganjil - Teknik Informatika
2019/2020 Genap - Perpustakaan dan Sains Informasi
2019/2020 Genap - Teknik Informatika
2020/2021 Antara - Teknik Informatika
2020/2021 Ganjil - Perpustakaan dan Sains Informasi
2020/2021 Ganjil - Teknik Informatika
2020/2021 Genap - Perpustakaan dan Sains Informasi
2020/2021 Genap - Teknik Informatika
2021/2022 Antara - Teknik Informatika
2021/2022 Ganjil - Perpustakaan dan Sains Informasi
2021/2022 Ganjil - Teknik Informatika
2021/2022 Genap - Perpustakaan dan Sains Informasi
2021/2022 Genap - Teknik Informatika
2022/2023 Antara - Teknik Informatika
2022/2023 Ganjil - Perpustakaan dan Sains Informasi
2022/2023 Ganjil - Teknik Informatika
2022/2023 Genap - Perpustakaan dan Sains Informasi
2022/2023 Genap - Teknik Informatika
Program Kompetisi Kampus Merdeka PdSI YARSI
MBKM Mandiri
Modul Aplikasi RIM
Modul Pustakawan Sistem
Modul RIM dalam IG
Program Studi Teknik Informatika
2023/2024 Antara - Teknik Informatika
2024/2025 Genap - Teknik Informatika
Pengembangan Permainan Digital 2024
Trek Pengembangan Komputasi Awan
2024/2025 Genap - Perpustakaan dan Sains Informasi
2024/2025 Antara - Teknik Informatika
2025/2026 Ganjil-Perpustakaan dan Sains Informasi
2025/2026 Ganjil - Teknik Informatika
Trek Kecerdasan Buatan
Trek Pengembangan Aplikasi Multiplatform
Trek Pengembangan Internet of Things
Open Course
Webinar Series (Open/Guest Access)
Pelatihan dan Bantuan
Template Courses
TUNTAS
Workshop
Summer Course YARSI
Home
Calendar
English (en)
Bahasa Indonesia (id)
English (en)
You are currently using guest access
Log in
Categories
Collapse
Expand
All categories
Fakultas Teknologi Informasi
2023/2024 Antara - Teknik Informatika
2023/2024 Ganjil Teknik Informatika
SP Khusus
2023/2024 Ganjil - Perpustakaan dan Sains Informasi
2023/2024 Genap - Perpustakaan dan Sains Informasi
2023/2024 Genap Teknik Informatika
2024/2025 Ganjil - Perpustakaan dan Sains Informasi
2024/2025 Ganjil - Teknik Informatika
Trek Kecerdasan buatan
Trek Pengembangan Aplikasi Multiplatform
Trek Pengembangan Internet Of Thing
Arsip
2019/2020 Antara - Teknik Informatika
2019/2020 Ganjil - Perpustakaan dan Sains Informasi
2019/2020 Ganjil - Teknik Informatika
2019/2020 Genap - Perpustakaan dan Sains Informasi
2019/2020 Genap - Teknik Informatika
2020/2021 Antara - Teknik Informatika
2020/2021 Ganjil - Perpustakaan dan Sains Informasi
2020/2021 Ganjil - Teknik Informatika
2020/2021 Genap - Perpustakaan dan Sains Informasi
2020/2021 Genap - Teknik Informatika
2021/2022 Antara - Teknik Informatika
2021/2022 Ganjil - Perpustakaan dan Sains Informasi
2021/2022 Ganjil - Teknik Informatika
2021/2022 Genap - Perpustakaan dan Sains Informasi
2021/2022 Genap - Teknik Informatika
2022/2023 Antara - Teknik Informatika
2022/2023 Ganjil - Perpustakaan dan Sains Informasi
2022/2023 Ganjil - Teknik Informatika
2022/2023 Genap - Perpustakaan dan Sains Informasi
2022/2023 Genap - Teknik Informatika
Program Kompetisi Kampus Merdeka PdSI YARSI
MBKM Mandiri
Modul Aplikasi RIM
Modul Pustakawan Sistem
Modul RIM dalam IG
Program Studi Teknik Informatika
2023/2024 Antara - Teknik Informatika
2024/2025 Genap - Teknik Informatika
Pengembangan Permainan Digital 2024
Trek Pengembangan Komputasi Awan
2024/2025 Genap - Perpustakaan dan Sains Informasi
2024/2025 Antara - Teknik Informatika
2025/2026 Ganjil-Perpustakaan dan Sains Informasi
2025/2026 Ganjil - Teknik Informatika
Trek Kecerdasan Buatan
Trek Pengembangan Aplikasi Multiplatform
Trek Pengembangan Internet of Things
Open Course
Webinar Series (Open/Guest Access)
Pelatihan dan Bantuan
Template Courses
TUNTAS
Workshop
Summer Course YARSI
Home
Calendar
Dashboard
Summary
Course information
Desain dan Analisis Algoritma
Teacher:
531141116036 muhammad fathurrachman
Synchronous Meeting Type
:
Blended (Online and Face-to-Face)
Skill Level
:
Beginner
