(SEMESTER PENDEK)
SILABUS:
1. PENDAHULUAN
2. FUNGSI KOMPLEKSITAS ALGORITMA
3. GREEDY ALGORITHM DAN DIVIDE AND CONQUER
4. DYNAMIC PROGRAMMING + TUGAS 1
5. SORTING
6. STRING MATCHING
7. STRUKTUR POHON / TREE
8. STRUKTUR GRAF
9. MINIMUM SPANNING TREE + TUGAS 2
10. UJIAN FINAL
PENILAIAN:
NILAI
81 - 100 : A
66 - 80 : B
51 - 65 : C
36 - 50 : D
0 - 35 : E