CS320-01 Schedule for Winter 2018

This page lists material covered in class. Reading assignments are not listed, students should stay ahead of coverage in their reading.
Week of Monday Wednesday Friday
Jan 1 No Class Chapter I
Introduction
Jan 8 Chapter II
Algorithmic Efficiency
Chapter III - Brute Force
Jan 15 Chapter III - Brute Force
Project One 1/15/18
Chapter IV
Decrease and Conquer
Jan 22 Chapter IV - Decrease and Conquer Chapter V
Divide and Conquer
Jan 29 Test One Chapter V - Divide and Conquer
Project Two 1/31/18
Feb 5 Chapter V - Divide and Conquer Chapter VI
Transform and Conquer
Feb 12 Chapter VI - Transform and Conquer Chapter VII
Space Time Tradeoffs
Project Three 2/16/18
Feb 19 Chapter VII
Space Time Tradeoffs
Test Two
Feb 26 Chapter VIII - Dynamic Programming
Project Four 2/28/18
Mar 5 No Class - Winter Term Break Week
Mar 12 Chapter VIII - Dynamic Programming
Project Five 3/16/18
Chapter IX
Greedy Algorithms
Mar 19 Chapter IX
Greedy Algorithms
Mar 26 Test Three Chapter X - Iterative Improvement
Project Six 3/28/18
Good Friday
no class
Apr 2 No Class Chapter X
Iterative Improvement
Chapter XI - Limitations of Algorithmic Power
Apr 9 Chapter XI
Limitations of Algorithmic Power
Chapter XII - Coping with Limitations of Power
Project Seven midnight 4/13/18
Apr 16 Final Exam
Monday, Apr 16, 8:30 AM