The reading listed for each week provides an overview of the material that will be covered in that week's lectures.
| WEEK | DAY | ANNOUNCEMENTS | TOPIC & READING | LAB |
|---|---|---|---|---|
| 1 | Jan 23 | Introduction to the course and C++
| Lab 1: Git and C++ | |
Jan 25 | ||||
| 2 | Jan 30 | Objects and Memory | ||
Feb 01 |
Drop/add ends (Feb 02) | Lab 2: More C++ | ||
| 3 | Feb 06 | Big-O Notation and Sorting
| ||
Feb 08 | Lab 3: OOP | |||
| 4 | Feb 13 | |||
Feb 15 | Test 1 in lab | Lists
| Lab 4: Sorting and Big-O | |
| 5 | Feb 20 | |||
Feb 22 | Stacks and Queues
| Lab 5: Linked Lists | ||
| 6 | Feb 27 | |||
Feb 29 | Induction and Invariants
| Lab 6: Stacks and Queues | ||
| 7 | Mar 05 | Dictionaries and Binary Search Trees
| ||
Mar 07 | ||||
Mar 12 | Spring Break | |||
Mar 14 | ||||
| 8 | Mar 19 | Balanced Binary Trees
| ||
Mar 21 | Test 2 in lab | Lab 7: BSTs | ||
| 9 | Mar 26 | Section 1 rebalancing BSTs, priority queues | Priority Queues
| |
Mar 28 | Section 1 heap details, heapsort CR/NC/W Deadline (Mar 29) | |||
| 10 | Apr 02 | Hash Tables
| ||
Apr 04 | Lab 8: Hash tables and Priority queues | |||
| 11 | Apr 09 | Graph Introduction and Implementation
| ||
Apr 11 | ||||
| 12 | Apr 16 | Graph Algorithms
| ||
Apr 18 | Test 3 in lab | Lab 9: Graphs | ||
| 13 | Apr 23 | More Graph Algorithms
| ||
Apr 25 | ||||
| 14 | Apr 30 | Fun topic TBD | ||
May 02 | Review | |||
May 13 | Final Exam (9am - 12pm, SCI Changhou) | |||