| Hafta | Teori Konu Başlıkları |
|---|---|
| 1 | Fundamentals of the Analysis of Algorithms Efficiency |
| 2 | Asymptotic Analysis |
| 3 | Analysis of Nonrecursive Algorithms |
| 4 | Analysis of Recursive Algorithms |
| 5 | Analysis of Divide and Conquer Algorithms |
| 6 | Hashing Algorithms 1 |
| 7 | MIDTERM |
| 8 | Hashing Algorithms 2 |
| 9 | Dynamic Programming 1 |
| 10 | Dynamic Programming 2 |
| 11 | Graph Algorithms 1 |
| 12 | Graph Algorithms 2 |
| 13 | Backtracking |
| 14 | NP, NP-Complete, NP-hard Problems |
| Hafta | Uygulama Konu Başlıkları |
|---|---|
| 1 | Fundamentals of the Analysis of Algorithms Efficiency |
| 2 | Asymptotic Analysis |
| 3 | Analysis of Nonrecursive Algorithms |
| 4 | Analysis of Recursive Algorithms |
| 5 | Analysis of Divide and Conquer Algorithms |
| 6 | Hashing Algorithms 1 |
| 7 | MIDTERM |
| 8 | Hashing Algorithms 2 |
| 9 | Dynamic Programming 1 |
| 10 | Dynamic Programming 2 |
| 11 | Graph Algorithms 1 |
| 12 | Graph Algorithms 2 |
| 13 | Backtracking |
| 14 | NP, NP-Complete, NP-hard Problems |
