| Aug 29: Order of Growth with Loops |
module1 |
|
Sept 7 |
| Aug 31: Order of Growth with Recursion |
module2 |
|
Sept 14 |
| Sept 12: Search Analysis and Lower Bounds |
module3 |
|
|
| Sept 14: Selection Analysis and Lower Bounds |
module4 |
|
Sept 21 |
| Sept 21: Sorting and Lower Bounds |
module5 |
|
Oct 3 |
| Exam 1 |
|
|
Sept 28 |
| Project 1 - Brute Force Sudoku |
Brute Force Sudoku |
BruteForce.zip |
Oct 5 |
| Oct 5: Graph Traversals |
module6 |
Graph.zip |
Oct 12 |
| Oct 12: Backtracking |
module7 |
|
|
| Oct 17: Minimum Cost Spanning Trees |
module8 |
|
|
| Exam 2 |
|
|
Oct 19 |
| Project 2 - Backtracking Sudoku |
Backtracking Sudoku |
BackTracking.zip |
Oct 26 |
| Project 3 - Greedy Sudoku |
Greedy Sudoku |
|
Nov 7 |
| Oct 31: Dijkstra's Algorithm |
module9 |
|
|
| Nov 2: Dynamic Programming |
module10 |
Knapsack.zip |
Nov 9 |
| Nov 7: Reductions |
module11 |
|
|
| Exam 3 |
|
|
Nov 14 |
| Project 4 - SAT Reduce Sudoku |
SAT Reduce Sudoku |
SatReduce.zip |
Dec 7 |
| Final |
|
|
Dec 14 9-11 |