| 1 |
Tentative Course Outline
(Homework and exam dates may change during the term. Please make sure that you check your ITU email address and ninova regularly!)
Week 1, Sept 21: Ch1: Role of Algorithms in Computing, Ch 2: Getting Started, Additional material: Secondary storage devices
Week 2, Sept 28: Ch. 3. Growth of Functions
Week 3, Oct 6: Ch 4. Recurrences
Week 4, Oct 12: Ch 5. Probabilistic Analysis and Randomized Algorithms
RECITATION
Week 5, Oct 19: Ch 6. Heapsort
HW1 Handed Out
Week 6, Oct 26: Ch 7. Quicksort, Ch 8. Sorting in Linear Time, Ch 10. Elementary Data Structures (Review)
Week 7, Nov 2: Ch 11. Hash Tables
HW2 Handed out.
RECITATION
Week 8, Nov 9: No Class (Kurban Bayramı)
Week 9, Nov 16: MIDTERM
Week 10, Nov 23: Ch 12. Binary Search Trees (Review) Ch 13. Red-Black Trees, Additional material: 2-3 Trees, 2-3-4 Trees
Week 11, Nov 30: Ch 14. Augmenting Data Structures, Ch 17. Amortized Analysis, RECITATION
Week 12, Dec 7: Ch 18. B Trees, Additional material: AVL Trees, Splay Trees
HW3 handed out.
Week 13, Dec 14: Ch 19. Binomial Heaps, Ch 20. Fibonacci Heaps, RECITATION
Week 14, Dec 21: Ch 30. Polynomials and the FFT
Week 15, Dec 28: Ch 32. String Matching, Course Review |