CS 225 Data Structures and Software Principles
Notes
| Dates | Topics | Notes | Readings | |
| Week 1 | 1/16-1/19 |
Intro to Course Classes: structure, syntax, etc. |
1/19a 1/19b |
Chapter 1 |
| Week 2 | 1/22-1/26 |
Constructors, Destructors, Pointers and Memory Classes, Parameter passing, constructors (destructors, etc.) Constructors, Destructors, and Overloading = |
1/22a
1/22b 1/24a 1/24b 1/26a 1/26b |
Chapter 1 Chapter 1 Chapter 1 |
| Week 3 | 1/29-2/2 |
Operator = overloading, templates Templates and Functors Inheritance |
1/29a
1/29b 1/31a 1/31b 2/2a 2/2b |
Chapter 1 Chapter 1 Chapter 1 |
| Week 4 | 2/5-2/9 |
Inheritance Continued Abstract Data Types and more Linked memory as an implementation paradigm |
2/5a
2/5b 2/7b 2/9a 2/9b |
|
| Week 5 | 2/12-2/16 |
List Data Structure Snow Day!!! Doubly Linked Lists |
2/12a
2/12b 2/16a 2/16b |
|
| Week 6 | 2/19-2/23 |
Stacks - Two Implementations Stacks and Queues Iterators and Generic Programming |
2/19a
2/19b 2/21a 2/21b 2/23a 2/23b |
|
| Week 7 | 2/26-3/2 |
Midterm Exam 1 - March 1, 7-9 Trees Tree Traversal Binary Tree Properties and Functions |
2/26a 2/26b 2/28a 2/28b 3/02a 3/02b |
|
| Week 8 | 3/5-3/9 |
Binary Trees Binary Trees Continued Class Cancelled March 9 |
3/5a
3/5b 3/07b |
|
| Week 9 | 3/12-3/16 |
AVL Trees Finish AVL Trees, Priority Queues Priority Queues - (min)Heaps |
3/12a
3/12b 3/14a 3/14b 3/16a 3/16b |
|
| Week 10 | 3/19-3/23 | Spring Break - No Classes | ||
| Week 11 | 3/26-3/30 |
Hashing More Hashing Skip Lists |
3/26a
3/26b 3/28a 3/28b 3/30 from last semester |
|
| Week 12 | 4/2-4/6 |
Midterm Exam 2 - April 5, 7-9 Skip List Analysis Disjoint Sets Class Cancelled April 6 |
4/2 from last semester 4/4 a 4/4 b |
|
| Week 13 | 4/9-4/13 |
Sets Graphs Graphs Continued |
4/9 4/11 a 4/11 b 4/13 a 4/13 b |
|
| Week 14 | 4/16-4/20 |
Graph Traversals BFS Traversals Connectivity |
4/16 a
4/16 b 4/18 a 4/18 b 4/20 a 4/20 b |
|
| Week 15 | 4/23-4/27 |
Strongly Connected Components and Topological Sort Dijkstra's, Topological Sort and Single Source Shortest Path Shortest Path, Minimum Spanning Trees |
4/23 a
4/23 b 4/25 a 4/25 b 4/27 a 4/27 b |
|
| Week 16 | 4/30-5/4 |
Minimum Spanning Trees and Dijkstra's Algorithm Minimum Spanning Trees, Prim's and Kruskal's Algorithms No Class May 4, Instruction has ended |
4/30 a
4/30 b 5/2 a 5/2 b |
|
| Week 17 | 5/7-5/11 | Do not look in the timetable for our final exam time! the time table final exams are for non-combined classs, and CS225 does not fall into that category. Our final exam time won't be known until about midsemester, and since it might end up being the last day of finals, you should assume that worst-case scenario and plan accordingly, in case that is indeed when our final exam occurs. |