COT 5405 Lectures

1. Lecture 01  Mathematics Background 1/6/04
2. Lecture 02  Mathematics Background 1/8/04
3. Lecture 03  Mathematics Background 1/13/04
4. Lecture 04  Mathematics Background 1/15/04
5. Lecture 05  Algorithm Analysis 1/20/04
6. Lecture 06  Recurrence Relations 1/22/04
7. Lecture 07  Data Structures2/12/04
8. Lecture 10  Algorithm Introduction2/17/04
9. Lecture 11  Greedy Algorithms2/19/04
10. Lecture 12  Greedy Algorithms: Dijkstra's2/24/03
11. Lecture 13  Divide and Conquer: Merge & Quick Sort2/26/04
12. Lecture 14  Divide and Conquer: Quickselect, Strassen, Skyline3/2/04
13. Lecture 15  Dynamic Programming3/16/04
14. Lecture 16  Dynamic Programming3/18/04
15. Lecture 17  Dynamic Programming3/18/04
16. Dynamic Programming Notes
17. Lecture 18  Maximal Contiguous Subsequent Sum and Graph Algorithms 3/23/04 (only Graph Stuff)
18. Lecture 19  Backtracking 3/25/04
19. Lecture 20  Branch & Bound 3/30/04
20. Reductions, NP, NP-Complete 4/1/04
    • Reductions
    • Proving Problems NP-Complete
    • Code for Subset Sum/Partition Reductions
21. Lecture 21  Probabilistic Algorithms 4/8/04
22. Final Exam Outline 4/13/04

Extra Notes for Sections not covered in class

• Turing Machine Stuff
  • Turing Machines
  • Proof that Standard and ND TMs are equivalent
  • Halting Problem
• Section 6.4: Proof of Scheduling & Dijkstra's Algorithms
• Section 6.5: Greedy Knapsack
• Section 6.6: Greedy Scheduling
• Section 8.1.2: The World Series
• Section 8.6: Chained Matrix Multiplication