Design and Analysis of Algorithms (DAA) (S1, Genap 2022, 3 SKS)

*** Adab di atas ilmu, beradablah terlebih dahulu sebelum menuntut ilmu ***

Lecturer: Dewi Sintiari

Textbooks:

• Introduction to Algorithms - T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein (2001)
• Introduction to the Design and Analysis of Algorithms - Anany Levitin (2012)

Lecture:

• Week01 - Introduction to DAA


• Week02 - Computational Complexity Analysis


• Week03 - Brute Force Algorithm (part 1)


• Week04 - Brute Force Algorithm (part 2)


• Week05 - Recursive Algorithm


• Week06 - Divide-and-Conquer Algorithm (part 1)
• Quick Sort Algorithm


• Week07 - Divide-and-Conquer Algorithm (part 2)


• Week07 - Decrease-and-Conquer Algorithm
• Week07 - Transform-and-Conquer Algorithm


• Week09 - Greedy Algorithm (part 1)


• Week10 - Greedy Algorithm (part 2)


• Week11 - Greedy method for Minimum Spanning Tree Problem


• Week12 - BFS, DFS, and Dynamic Graph


• Week13 - Backtracking
• Week13 - Branch-and-Bound


• Week14 - Dynamic Programming


• Week15 - Teori P, NP, NP-Complete

Notes:

• Greedy algorithm for Knapsack problem and Huffman code
  • Semester 6
  • Semester 4

Assignment:

• Assignment01 - Time complexity
• Assignment02 - Menulis Makalah Ilmiah
• Template penulisan makalah
• Assignment03 - Theory and practice (brute force and recursive algorithms)
• Assignment04 - Greedy algorithm
• Assignment06 - Algoritma Greedy pada MST
• Assignment07 - Membuat program untuk penyelesaian MST dan Shortest Path Problem
• Assignment08 - Penerapan strategi Backtracking dan Branch-and-Bound

Presentation topic:

• Week 10
• Week 11
• Week 12
• Week 13
• Week 14

Exam:

• Midterm
• Final

Teaching Preparation (Perangkat Pembelajaran):

• Silabus
• Rencana Pembelajaran Semester (RPS)
• Rencana Tugas Mahasiswa (RTM)
• Kontrak Perkuliahan