(Latest Revision: 02/26/2006)
Week 03 Notes for CS 4440, Section 001
- Take Roll.
- Announcement(s)
- Notes for class
- Go over Dijkstra's Algorithm
- Go over big-O considerations for Dijkstra's Algorithm
- Look at a proof that the interval scheduling algorithm works (in
04greed.ppt)
- Look at a proof that Dijkstra's algorithm works (in 04greed.ppt)
- Look at the assigned homework problems