Summer 2010 COP 3503 Lecture Notes

• Math and Algorithm Analysis
  • Sorted List Matching and MCSS (5/18)
  • Algorithm Analysis (5/18)
  • Probability (5/20)
  • Theoretical and Actual Run-Time (5/20)
  • addthree.java
  • sieve.java
  • timingdata.xls
  • Amortized Analysis (5/25)
  • Andy's Notes
• Data Structures (5/27)
  • Hash Tables
  • Binary Heaps
  • Disjoint Sets
• More Data Structures (6/1)
  • AVL Trees
  • 2-4 Tree Insertion
  • 2-4 Tree Deletion
• Recursive Comparison Sorts Analysis (6/3)
  • Merge Sort
  • Quick Sort
• More Sorting (6/3,6/10)
  • Notes
  • testsort.java
• Exam Review (6/15)
  • Outline
  • Review Questions and Answers
• Graphs (6/22, 6/29)
  • Graph Basics
  • Topological Sort
• Dijkstra's Algorithm (7/1)
• Greedy Algorithms (6/24, 6/29, 7/1)
  • General Background
  • Huffman Coding
  • Minimum Spanning Trees
• Divide and Conquer (7/6)
  • Int. Mult., Trominos, Skyline
  • Closest Pts., Strassen's(skipped)
  • tile.java
  • tile2.java
  • subsetsumrec.java
• Exam #2 Review (7/6)
• 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
  • floyd.java
• Dynamic Programming: Matrix Chain Multiplication (7/20)
  • Notes
• Backtracking (7/22)
  • Notes #1
  • EightQueens.java
  • MagicSquare.java
• Network Flow (7/27)
• String Matching
• Final Exam Review Notes (8/3)