COP 4531 Notes - Chris Lacher

 
Review General 20. Graphs 21. Strings                   
  1. Positional Containers  

  2. Associatve Containers  

  3. Introduction to Algorithm Analysis  

  4. Data Structure Algorithms  

  5. Function Classes & Objects  

  6. Iterators  

  7. Generic Algorithms  

  1. Hash Tables  

  2. Hash Table Analysis  

  3. Generic Heap Algorithms  

  4. Advanced Heap Algorithms 

  5. Generic Set Algorithms  

  6. Sorts  

  7. Calculating Asymptotics  

  8. Binary Trees and QuickSort 

  9. Amortized Analysis  

  10. Divide & Conquer

  11. Dynamic Programming 

  12. Greedy Algorithms 

  1. Disjoint Sets  

  2. Graphs 1: Representation, Search & Survey  

  3. FSU Graph Framework  

  4. Graphs 2: Search Trees & Related Algorithms 

  5. Graphs 3: Edge Weighted Graphs*    

  6. Graphs 4: Random Graphs and Giant Components 

  7. Graphs 5: The Graph Laplacian*  

  8. Maze Tech  

  9. mazebuilder 1.0
    mazebuilder 1.1  

  1. Alphabets & Strings  

  2. String Sorts  

  3. Substring Search  

  4. String Matching  

22. Hard Problems and NP* 
*These notes are under development