Lecture Note Summary #1

Vincent Zimmer
Mark Pustilnik
Robert Laggart
Mark Autry

1 October 1997

 
• Course Goals
• Introduction to algorithm design and analysis
  • Random Access Machine model
  • Types of Complexity
  • Big Oh Notation
  • Algorithm design
  • Dynamic Programming
    • Example: Approximate String Matching
    • Dynamic Program for Approximate String Matching
    • Dynamic Programming Summary
• Easy Graph Problems
  • Graph Terminology
  • Traversing a Graph
  • Depth-First Search
  • Topological Sorting
  • Planarity Testing
  • Minimum Spanning Tree
  • Prim's algorithm
  • Dijkstra's Algoritm for shortest path problems
• References
• About this document ...