| Kode Mata Kuliah | IF5110 / 3 SKS |
|---|
| Penyelenggara | 235 - Informatics / STEI |
|---|
| Kategori | Lecture |
|---|
| Bahasa Indonesia | English |
|---|
| Nama Mata Kuliah | Desain Algoritma | Algorithm Design |
|---|
| Bahan Kajian | - Review basic concepts of algorithms: time complexity, data structures, heaps & disjoint sets data structures
- Techniques based on recursion: induction, divide & conquer, dynamic programming
- First cut techniques: greedy, graph traversal
- Complexity of problems: NP-complete problems,
computational complexity, lower bounds
- Coping with hardness: backtracking, randomized algorithms, approximation algorithm
- Iterative improvement for domain-specific problems: network flow, matching
- Techniques in Computational Geometry: Geometric sweeping,Voronoi diagrams
|
|
|---|
| Capaian Pembelajaran Mata Kuliah (CPMK) | - Mampu mengidentifikasi algoritma yang paling tepat untuk suatu persoalan yang diberikan, dengan menganalisis trade off dari setiap alternatif yang ada.
- Mampu menyelesaikan masalah dunia nyata dengan mengimplementasikan algoritma yang paling tepat
| - Able to identify the most appropriate algorithm for given problem, by analyzing the trade-of s of each alternatives
- Able to solve real world problem through implementing the most appropriate algorithm
|
|---|
| Metode Pembelajaran | Pembelajaran tatap muka, diskusi | |
|---|
| Modalitas Pembelajaran | Pembelajaran tatap muka, diskusi | |
|---|
| Jenis Nilai | ABCDE |
|---|
| Metode Penilaian | Ujian/kuis tertulis, Tugas Besar | |
|---|
| Catatan Tambahan | | |
|---|