Course Schedule

Dates Topics Notes

Week 1 8/23 - 8/25 Intro to Course
Pointers and References 8/23
8/25

Week 2 8/28 - 9/1 Functions and Parameter Passing
Classes and Constants
Constructors, Destructors, Copy Constructors, and Overloading 8/28
8/30
9/01

Week 3 9/4 - 9/8 There will be no lecuture on Monday, Sept. 4
Destructors, Copy Constructors, and Overloading
Templates
9/06
9/08

Week 4 9/11 - 9/15 Inheritance, Templates, and Static Binding
Inheritance, Virtual Functions, and Abstract Base Classes
Stacks 9/11
9/13
9/15

Week 5 9/18 - 9/22 Stacks and Queues, Push and Pop
Stacks and Queues with Linked Lists, Vectors, and Lists
Linked Lists and Positions 9/18
9/20
9/22

Week 6 9/25 - 9/29 Lists, Vectors vs. Lists
Iterators
Trees 9/25
9/27 9/27 b
9/29

Week 7 10/2 - 10/6 Midterm 1
Trees and Traversing Them
Tree Traversals and Binary Search Trees
There will be no lecture on Friday, October 6
10/2 10/2 b
10/4 10/4 b

Week 8 10/9 - 10/13 Find, Insert, and Remove for Trees
Binary Tree Properties and Functions
AVL Trees
10/9 10/9 b
10/11 10/11 b
10/13 10/13 b

Week 9 10/16 - 10/20 AVL Trees, Priority Queues, and Heaps
AVL Trees, Priority Queues, and Heaps
Text Encoding and Huffman Encoding 10/16 10/16 b
10/18 10/18 b
10/20 10/20 b

Week 10 10/23 - 10/27 Hashing and Hash Functions
Handling Hash Collisions
Hash Table Performance, Skip List Intro. 10/23
10/25 10/25 b
10/27 10/27 b

Week 11 10/30 - 11/3 Skip Lists
Skip List Analysis
Disjoint Sets 10/30 10/30 b
11/1 11/1 b
11/3 11/3 b

Week 12 11/6 - 11/10 Midterm 2
Sets
Graphs
There will be no lecture on Friday, November 10
11/6 11/6 b
11/8 11/8 b

Week 13 11/13 - 11/17 Graphs Continued
Graph Traversals - DFS
DFS and BFS Traversals 11/13 11/13 b
11/15 11/15 b
11/17 11/17 b

Week 14 11/20 - 11/24 No Classes This Week, Thanksgiving Vacation!

Week 15 11/27 - 12/1 Connectivity
Strongly Connected Components and Topological Sort
Topological Sort and Single Source Shortest Path 11/27 11/27 b
11/29 11/29 b
12/1 12/1 b

Week 16 12/4 - 12/8 Dijkstra's Single Source Shortest Path Algorithm
Minimum Spanning Trees and Primm's Algorithm
Minimum Spanning Trees and Kruskal's Algorithm 12/4 12/4 b
12/6 12/6 b
12/8 12/8 b

Week 17 DO NOT LOOK IN THE TIMETABLE FOR OUR FINAL EXAM TIME! the time table final exam times are for non-combined classes, 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. The final exam will be on December 13 from 8-11am.

	Dates	Topics	Notes
Week 1	8/23 - 8/25	Intro to Course Pointers and References	8/23 8/25
Week 2	8/28 - 9/1	Functions and Parameter Passing Classes and Constants Constructors, Destructors, Copy Constructors, and Overloading	8/28 8/30 9/01
Week 3	9/4 - 9/8	There will be no lecuture on Monday, Sept. 4 Destructors, Copy Constructors, and Overloading Templates	9/06 9/08
Week 4	9/11 - 9/15	Inheritance, Templates, and Static Binding Inheritance, Virtual Functions, and Abstract Base Classes Stacks	9/11 9/13 9/15
Week 5	9/18 - 9/22	Stacks and Queues, Push and Pop Stacks and Queues with Linked Lists, Vectors, and Lists Linked Lists and Positions	9/18 9/20 9/22
Week 6	9/25 - 9/29	Lists, Vectors vs. Lists Iterators Trees	9/25 9/27 9/27 b 9/29
Week 7	10/2 - 10/6	Midterm 1 Trees and Traversing Them Tree Traversals and Binary Search Trees There will be no lecture on Friday, October 6	10/2 10/2 b 10/4 10/4 b
Week 8	10/9 - 10/13	Find, Insert, and Remove for Trees Binary Tree Properties and Functions AVL Trees	10/9 10/9 b 10/11 10/11 b 10/13 10/13 b
Week 9	10/16 - 10/20	AVL Trees, Priority Queues, and Heaps AVL Trees, Priority Queues, and Heaps Text Encoding and Huffman Encoding	10/16 10/16 b 10/18 10/18 b 10/20 10/20 b
Week 10	10/23 - 10/27	Hashing and Hash Functions Handling Hash Collisions Hash Table Performance, Skip List Intro.	10/23 10/25 10/25 b 10/27 10/27 b
Week 11	10/30 - 11/3	Skip Lists Skip List Analysis Disjoint Sets	10/30 10/30 b 11/1 11/1 b 11/3 11/3 b
Week 12	11/6 - 11/10	Midterm 2 Sets Graphs There will be no lecture on Friday, November 10	11/6 11/6 b 11/8 11/8 b
Week 13	11/13 - 11/17	Graphs Continued Graph Traversals - DFS DFS and BFS Traversals	11/13 11/13 b 11/15 11/15 b 11/17 11/17 b
Week 14	11/20 - 11/24	No Classes This Week, Thanksgiving Vacation!
Week 15	11/27 - 12/1	Connectivity Strongly Connected Components and Topological Sort Topological Sort and Single Source Shortest Path	11/27 11/27 b 11/29 11/29 b 12/1 12/1 b
Week 16	12/4 - 12/8	Dijkstra's Single Source Shortest Path Algorithm Minimum Spanning Trees and Primm's Algorithm Minimum Spanning Trees and Kruskal's Algorithm	12/4 12/4 b 12/6 12/6 b 12/8 12/8 b
Week 17		DO NOT LOOK IN THE TIMETABLE FOR OUR FINAL EXAM TIME! the time table final exam times are for non-combined classes, 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.	The final exam will be on December 13 from 8-11am.