TOPICS for 22C:031:001 (CS:3330:0001)

Algorithms.  Spring 2013.

• Week 1: Introduction and Analysis (ch 1 and 2)
• Week 2: Brute Force Algorithms (ch 3)
• Week 3: Sorting and Divide and Conquer (ch 4)
• Week 4: Mergesort and Quicksort (ch 5)
• Week 5: Balanced Search Trees (ch 6)
• Week 6: Heapsort (ch 6)
• Week 7: String Matching (ch 7)
  
• Week 8: Hashing and B-Trees (ch 7)
  
• Week 9: Dynamic Programming (ch 8)
  
• Week 10: Dynamic Programming (ch8)
  
• Week 11: Greedy Algorithms (ch 9)
• Week 12: Iterative Improvement Algorithms (ch 10)
  
• Week 13: Decision Trees (ch 11)
  
• Week 14: Limitations:  NP-complete problems (ch 11)
• Week 15: Branch and Bound, Approximation Algorithms (ch 12)

Note: this is a tentative plan some small variation may occur in the schedule and list of topics.