Summer class: May 19th - August 9th
- Week 1: Abstract data types (ADTs): immutable lists, stacks, queues; Algorithms & Big-O notation, Unit-testing concepts & JUnit
- Week 2: Stack, set, & map ADTs, unit-testing methodologies, set notation
- Week 3: Recursion & recursive data structures; more testing methodologies; binary search trees (BST), including threaded BSTs; lambda expressions
- Week 4: Algorithm design techniques; heaps; priority queue ADT; tries; Huffman coding
- Week 5: Applying data structures to problems; writing methods that accept lambdas; Graph ADT
- Week 6: Disjoint Set ADT; Comparison-based sorting algorithms
- Week 7: Radix sort, minimum spanning tree (MST) algorithms; Skip list structure, randomization; AVL balanced BST; Hash tables
- Week 8: Balanced BST's: 2-3-4 trees, B-Trees, and red-black trees
- Week 9: Shortest-path algorithms; survey of more advanced structures; exam preparation
- Final week: Review & exam preparation
| Lab | Status |
|---|---|
| 1L | ✅ Completed |
| 2L | ✅ Completed |
| 3L | ✅ Completed |
| 4L | ✅ Completed |
| 5L | ✅ Completed |
| 6L | ✅ Completed |
| 7L | ✅ Completed |
| 8L | ⬜ Not Started |
| 9L | ⬜ Not Started |
| 10L | ⬜ Not Started |
| 11L | ⬜ Not Started |
| 12L | ⬜ Not Started |
| 13L | ⬜ Not Started |
| Program | Due Date | Status |
|---|---|---|
| 1P | ✅ Completed | |
| 2P | ✅ Completed | |
| 3P | ✅ Completed | |
| 4P | ⬜ Not Started | |
| 5P | ✅ Completed | |
| 6P | ⬜ Not Started | |
| 7P | ⬜ Not Started | |
| 8P | ⬜ Not Started | |
| 9P | ⬜ Not Started |
- 2/10 weeks completed
- 7/13 labs completed (0 in progress)
- 5/9 programming assignments completed (0 in progress)