Week # Lecture #s Description
| 15 |
- Final Exam - DUNN 106, 9:00am-11:00am
| 14 | - 40
- 41
- Review
- Exam 3
| 13 | - 39
- 38
- 37
- Review
- Red Black
- Red Black
| 12 | - 36
- 35
- 34
- AVL trees continued HW#6
- Find kth Smallest, AVL tree
- Max Depth, Height - Extra Credit
| 11 | - 33
- 32
- 31
- BFS, HW
- BST implementations, DFS
- BST trees HW#5
| 10 | - 30
- 29
- 28
- queues
- ADVISING DAY
- Exam Review, stacks
| 9 | - 27
- 26
- 25
- Exam
- Review
- Vectors
| 8 | - 24
- 23
- 22
- classes revew
- purely virtual
- inheritance, overriding virtual functions, static vs dynamic
| 7 | - 21
- 20
- 19
- exam review HW#4
- file input/output
- fstream, c-strings
| 6 | - 18
- 17
- 16
- ostream, istream, friends
- Operator Overloading
- Exam #1
| 5 | - 15
- 14
- 13
- Review extra credit!
- Templates
- Linked List work
| 4 | - 12
- 11
- 10
- The Big 3
- Snow Day
- Destructors, Classes
| 3 | - 9
- 8
- 7
- Constructors, Initializer lists hw3!
- Deep vs Shallow Copies, Pointers with Classes
- Recursion practice - Power O(n), Fib O(2^n), Stack Overflow
| 2 | - 6
- 5
- 4
- Recursion Basics
- Linked Lists - "head" node -hw2!
- Linked Lists, structs, arrow operator
| 1 | - 3
- 3
- 2
- 1
- 1
- Memory Diagrams. Collected: hw1!
-
Not collected: Chapter 1 problems: 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.8
- Dynamic vs Static, stale ptr, double delete, return by value, NULL pointer
- Call by Reference, Memory Diagrams, Pointers
- Syllabus
|
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| | | | | |