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

Algorithms.  Summer 2014.

• Week 1: Introduction and Analysis (ch 2), Brute Force Algorithms (ch 3).
  

• Week 2 : Decrease and Conquer: (ch4), Divide and Conquer  (ch5)
  
  
• Week 3: Partitioning algorithms, Quickselect, Quicksort (ch4 and 5) , Search trees (BST and AVL) and Heapsort, (ch6),
  
  
• Week 4: Space and Time Trade-Offs: String Matching, Hashing and B-Trees. (ch 7)
  
  
• Week 5: Dynamic Programming (ch 8)
  
  
• Week 6: Greedy Algorithms (ch 9)
  
  
• Week 7: Iterative Improvement Algorithms (ch 10), Decision Trees and class of algorithms (ch 11),
  
  
• Week 8: Backtracking, Branch and Bound (ch 12)

Note: this is a tentative plan, small variation may occur in the schedule and list of topics,
specially in weeks 7 and 8.