Week 01 Notes for CS 4440, Section 001

• Take Roll.
• Announcement(s)
• Go over the steps in the following algorithms
  • Making Change
  • Kruskal's Algorithm for Min Cost Spanning Tree
  • Prim's Algorithm for Min Cost Spanning Tree
  • Dijkstra's Algorithm for Single Source, All Nodes, Shortest Paths
  • The Knapsack Problem
  • Shortest Job First
  • Scheduling with Deadlines (Slow Method)
  • Scheduling with Deadlines (Fast Method)
• Go Over Proofs That Some of the Greedy Algorithms Work
  • Prim's
  • Shortest Job First
  • Other?
• Go Over Big-O Analysis of Some of the Greedy Algorithms
  • Prim's
  • Kruskal's
  • Dijkstra's
  • Scheduling with Deadlines (Fast Method)
  • Other?
• Go Over Notes on the Union-Find Problem (Disjoint Set Structures)