Announcement
- [9/12/2015, 14:57] Soal Latihan UAS dapat diunduh di bagian Homework.
- [3/12/2015, 06:54]Latihan Strategi Algoritma dapat diunduh di bagian Homework.
- [18/11/2015, 18:48]Deskripsi tugas besar sudah bisa didownload di bagian Tugas Besar.
- Tugas 2 sudah bisa didownload, selamat mengerjakan. Hint : Fokus pada makna dari loop invarian/hipotesis, dan bagaimana membuktikan ia tetap benar pada Initialisation, Maintenance, dan Termination. Pembuktian tidak harus hanya dengan substitusi equation persis seperti contoh, tapi juga bisa dengan jawaban secara naratif logis. Referensi Cormen 3rd Edition Chapter 2.
- Jawaban lengkap latihan 1 sudah bisa didownload.
Course Schedule and Materials
Slide adalah slide yang digunakan pada kelas paralel, materi mungkin sedikit berbeda dari segi waktu, cara, dan detail penyampaian.
| Tanggal | Materi | Slide |
|---|---|---|
| 24/8/2015 | Introduksi, Overview Iterative dan Recursive | lec1 |
| 26/8/2015 | Tidak ada kuliah | – |
| 31/8/2015 | Correctness | lec2 |
| 2/9/2015 | Tidak ada kuliah | – |
| 7/9/2015 | Correctness Iterative | lec3 |
| 9/9/2015 | Algorithm Complexity | lec4 |
| 14/9/2015 | Asymptotic Complexity | lec5 |
| 16/9/2015 | Mathematical Analysis of Non-recursive | lec6 |
| 21/9/2015 | Mathematical Analysis of Recursive & Brute Force | lec7,lec8a |
| 28/9/2015 | Brute Force & Greedy | lec8b,lec9 |
| 30/9/2015 | Greedy Contd | lec10 |
| UTS | UTS | UTS |
| 4/11/2015 | Divide and Conquer | lec11 |
| 11/11/2015 | Divide and Conquer cont’d | – |
| 16/11/2015 | Dynamic Programming | lec13 |
| 19/11/2015 | Dynamic Programming cont’d | – |
| 13/11/2015 | Review Materi UTS | Rev1 |
Tugas Besar
Deskripsi tugas besar bisa didownload di sini.
Homework
Tugas dikirim ke email [email protected] dengan mencantumkan subject yang telah ditentukan (copy paste text pada kolom subject, jangan ditambah atau dikurangi)
| Tanggal | Soal | Deadline | Subject email | Solusi |
|---|---|---|---|---|
| 24/8/2015 | Fibonacci | 28/8/2015:22.00 | [DAA] | – |
| 7/9/2015 | Correctness | – | – | Solusi |
| 11/9/2015 | Correctness & Complexity | 14/9/2015:07.00 | DAA02 | – |
| 3/12/2015 | Backtracking & Branch and Bound | 7/12/2015:08.30 | Di kelas | – |
| 9/12/2015 | Latihan Uas | – | – | – |
Description
Introduction to the mathematical analysis of correctness & complexity of algorithms to solve a particular problem using an appropriate algorithm’s strategic.
Prerequisites
- Dasar Algoritma dan Pemrograman
- Algoritma dan Struktur Data
Grading Policy
| Activities | Percentages |
|---|---|
| Quizzes/Homework/Assignments | 10% |
| Project | 20% |
| Midterm Exam | 30% |
| Final Exam | 40% |
Textbooks and recommended readings
- Introduction to Algorithms, 2nd edition H. Cormen, C. E. Leiserson, R. L. Rivest, and Clifford Stein Published by: MIT Press or McGraw-Hill
- Introduction to the design and analysis of algorithm Anany Levitin Published by: Addison Wesley 2003
- Foundations of algorithms Richard Neapolitan and Kumarss Naimipour Published by D.C Heath and Company 1996