Schedule
Important Notice: This is intended to be an overview of the material to be covered in the course, it is subject to change at any time.
| Date | Topic |
Lab |
Textbook
Reading |
|
| Week 1 | 9/6 | Introductions, course requirements, code review, math review | No Labs | Chapter 1 V1-4 |
| 9/8 |
Circular Arrays, Dynamic Arrays, Lists |
|
Chapter 3 V1-4 |
|
| Week 2 | 9/13 | Linked Lists | Lists | Chapter 3 V1-4 |
| 9/15 | Mathematical Review, Big O |
|
Chapter 2 V1-4 | |
| Week 3 | 9/20 | Asymptotic Analysis, Big O notation, Abstract Data Types | Stacks | Chapter 2 V1-4 |
| 9/22 | Stacks, Queues | Chapter 4 V1-4 | ||
| Week 4 | 9/27 | Stacks, Queues | Queues | Chapter 4 V1-4 |
| 9/29 | Stacks, Queues | Chapter 5 V1-4 | ||
| Week 5 | 10/4 |
Intro Trees, Tree traversals, Binary Search Trees, randomized BST |
Binary Search Trees |
Chapter 5 V1-4 |
| 10/6 |
Balanced Trees, randomized BST, 234 Trees. |
Chapter 13V1-4 | ||
| Week 6 | 10/11 | SkipLists | Advanced Programming 1 |
Chapter 13V1-4 |
| 10/13 | Heaps | Chapter 7 V1-4 | ||
| Week 7 | 10/18 | Elementary Sorting, Heapsort | Review for midterm | Chapter 7 - 8 V1-4 |
| 10/20 | In class review | |||
| Week 8 | 10/25 | MIDTERM | Heaps |
|
| 10/27 | Go over midterm, QuickSort | Chapter 9 V1-4 | ||
| Week 9 | 11/1 | Quirsort anaylsis | Graph Introduction |
Chapter 9 V1-4 |
| 11/3 | Graphs intro, graph data structures | Chapter 17 V5 | ||
| Week 10 | 11/8 |
Graph Traversals, Depth First Search, Breadth First Search |
Advanced Graphs |
Chapter 18 V5 |
| 11/10 | Minimum Spanning Trees | Chapter 20 V5 |
||
| Week 11 | 11/15 | Minimum Spanning Trees | Advanced Programming 2 |
Chapter 20 V5 |
| 11/17 | ShortestPath | Chapter 21 V5 | ||
| Week 12 | 11/22 | ShortestPath | NO LABS | Chapter 21 V5 |
| Week 13 | 11/29 | Hashing | More Graphs |
Chapter 14 V1-4 |
| 12/1 | Chapter 14 V1-4 | |||
| Week 14 | 12/6 | Hashing | EXTRA REVIEW | |
| 12/8 | Finish up/ Review | |||
| Final | 12/15 | FINAL EXAM |