COP 3503 Lecture Notes

• Math and Algorithm Analysis (Weeks 1- 3)
  • Sorted List Matching and MCSS
  • Algorithm Analysis
  • Probability
  • Theoretical and Actual Run-Time
  • addthree.java
  • sieve.java
  • timingdata.xls
• Divide and Conquer (Weeks 10,11)
  • Int. Mult., Trominos, Skyline
  • Closest Pts., Strassen's(skipped)
  • tile.java
  • tile2.java
  • subsetsumrec.java
• Dynamic Programming: Longest Common Subsequence (7/13)
  • Notes
• Dynamic Programming: Edit Distance (7/13)
  • Notes
• Dynamic Programming: Introduction and Change Problem (7/15)
  • Intro Notes
  • Change Notes
  • change2.java
• Dynamic Programming: 0-1 Knapsack Problem (7/15)
  • Notes
• Dynamic Programming: Floyd-Warshall's Algorithm (7/20)
  • Notes
• Dynamic Programming: Matrix Chain Multiplication (7/20)
  • Notes
• String Matching
• Final Exam Review Notes (8/3)