Week # | Lecture #s | Description | Files/HW/Links
|
16 | | | |
15 | |
- Reading Day
- 3 Sorts
- Big-Oh
| |
14 | | | |
13 | |
- Review
- Rotations
- Comparisons/Practice
| |
12 | |
- AVL trees
- AVL Trees
- Trees in Code
| |
11 | |
- Red-Black Trees
- Advising Day
- Red-Black Trees
| |
10 | | | |
9 | |
- Review, Trees
- Trees in code
- Depth First Traversal (pre,post,in- order), Breadth First Traversal
| |
8 | | | |
7 | |
- Programming Recursion, Tree Basics
- Exam
- Recursion Review
| |
6 | | | |
5 | |
- Stacks/Queues
- Vectors, Strings
- Exam
| |
4 | |
- Classes Wrapup
- Overloading
- Classes, Big 3
| |
3 | |
- Classes/Inheritance
- -Wall, Linked Lists
- Pointers and Classes
| |
2 | |
- Linked Lists
- Linked Lists and Code
- Linked Lists
| |
1 | |
- Dynamic Arrays and Memory
- Continued Review
- Syllabus and Review
|
|