Kode Mata KuliahIF5110 / 3 SKS
Penyelenggara235 - Informatika / STEI
KategoriKuliah
Bahasa IndonesiaEnglish
Nama Mata KuliahDesain AlgoritmaAlgorithm Design
Bahan Kajian
    1. eview basic concepts of algorithms: time complexity, data structures, heaps & disjoint sets data structures
    2. Techniques based on recursion: induction, divide & conquer, dynamic programming
    3. First cut techniques: greedy, graph traversal
    4. Complexity of problems: NP-complete problems, computational complexity, lower bounds
    5. Coping with hardness: backtracking, randomized algorithms, approximation algorithm
    6. Iterative improvement for domain-specific problems: network flow, matching
    7. Techniques in Computational Geometry: Geometric sweeping, Voronoi diagrams
    Capaian Pembelajaran Mata Kuliah (CPMK)
    1. Mampu mengidentifikasi algoritma yang paling tepat untuk suatu persoalan yang diberikan, dengan menganalisis trade off dari setiap alternatif yang ada.
    2. Mampu menyelesaikan masalah dunia nyata dengan mengimplementasikan algoritma yang paling tepat
    3. Mampu mengevaluasi kesesuaian algoritma yang diimplementasikan dalam menyelesaikan masalah dunia nyata.
    1. Able to identify the most appropriate algorithm for given problem, by analyzing the trade-offs of each alternatives
    2. Able to solve real world problem through implementing the most appropriate algorithm
    3. Able to evaluate the effectiveness and suitability of implemented algorithms in addressing real-world problems.
    Metode PembelajaranPembelajaran tatap muka, diskusi
    Modalitas PembelajaranPembelajaran tatap muka, diskusi
    Jenis NilaiABCDE
    Metode PenilaianUjian/kuis tertulis, Tugas Besar
    Catatan Tambahan