![]() |
CS420dl Schedule
|
|
|
||
| Period From-To |
Material | Tasks |
|---|---|---|
| week 1 May 14 - May 20 |
Problems, Algorithms |
|
week 2 May 21 - May 27 |
Math fundamentals upper and lower bounds |
|
week 3 May 28 - June 3 |
Recurrence Relations |
|
week 4 June 4 - June 10 |
Sorting complexity |
|
week 5 June 11 - June 17 |
Test |
|
week 6 June 18 - June 24 |
Loops Loop Analysis |
|
week 7 June 25 - July 1 |
Graph Traversals Greedy Algorithms |
|
week 8 July 2 - July 8 |
Dynamic Programming |
|
week 9 July 9 - July 15 |
Backtrack |
|
week 10 July 16 - July 22 |
Knapsack |
|
week 11 July 23 - July 29 |
Shortest paths |
|
| week 12 July 28 - Aug 1 |
Final Test |
|
Copyright © Colorado State University. All rights reserved.