Lecture and tutorial notes

Lectures

• Greedy Algorithms (Weeks 1 and 2)
• Dynamic Programming Algorithms (Weeks 3 and 4)
• Flow Algorithms (Week 5)
  Flow Example This is an example in which the Ford-Fulkerson algorithm does not terminate.
• Turing Machines and Reductions (Weeks 6 and 7)
  Turing machine simulator
• NP and NP-Completeness (Weeks 8,9 and 10)
  Million dollar problem (Click on P vs NP)
• Computability and Noncomputability (Weeks 11 and 12)

Tutorials

• Week 1 .
• Week 2: Activity Scheduling (page 17-19) in the course notes (Greedy Algorithms).
  
• Week 3: The solution to the Change Making problem in postscript and in pdf format.
• Week 4: Viterbi algorithm in postscript and in pdf format.
• Week 5: No tutorial (test 1).
• Week 6: The notes for the matching problem in PS and pdf format. The other problem discussed was Theorem 1 in Turing Machine lecture notes.
• Week 7: In postscript and in pdf format.
• Week 8: No tutorial (Canada day).
• Week 9: No tutorial (Term test 2).
• Week 10: Pages 1014-1016 of CLR book.