PSU CS 350 - Algorithms and Complexity (Spring 2011)

Weekly outline

• 
  

  General

  • News forum
  • Syllabus File
• 
  

  28 March - 3 April

  Problem Definition; Computation Cost
  Read: Chapter 1, 2.1-2.5

  • HW 1 - Fundamentals Assignment
• 
  

  4 April - 10 April

  Design and Analysis of Simple Algorithms
  Read: Chapter 3

  • HW 2 - Brute Force etc Assignment
• 
  

  11 April - 17 April

  Greedy Algorithms
  Read: Chapter 9
• 
  

  18 April - 24 April

  Divide and Conquer
  Read: Chapter 4
• 
  

  25 April - 1 May

  Decrease and Conquer
  Read: Chapter 5

  • HW 3 - Greed and Division Assignment
• 
  

  2 May - 8 May

  Midterm Exam; Transform and Conquer
  Read: Chapter 6.1, 6.3-6.6
• 
  

  9 May - 15 May

  Catch Up and Conquer

  • HW 4 - Shrinkage and Remolding Assignment
• 
  

  16 May - 22 May

  Space and Time Tradeoffs; Computational Complexity
  Read: Chapter 7, 11.1, 11.3
• 
  

  23 May - 29 May

  Dynamic Programming; Iterative Improvement
  Read: Chapter 8.2, 8.3, 10.3, 10.4
• 
  

  30 May - 5 June

  Final Thoughts
  Monday 30 May: Memorial Day, no class meeting
  Wednesday 1 June: Review
  Final Exam: 5:30-7:20 PM Monday 6 June.