Week 03 Notes for CS 4440, Section 001 -- Spring 2002

• Take Roll.
• Announcement(s)
  • I will be out of town on Wednesday. Work on the programming assignment.
  • I posted the reading and homework assignment for weeks three and four.
• Clear up any misconceptions about what is involved in working the homework problems.
• Finish up discussion of Dijkstra's Algorithm
• Discuss the Union-Find Algorithm
• Continue with some of these topics from chapter 6:
  • Knapsack problem -- (interesting to consider that finding a greedy approach seems equivalent to finding a selection function that makes a problem space where every peak is an optimal solution.)
  • min time in system scheduling
  • scheduling with deadlines