| Mon | Wed | Fri | Assignments/Recitations |
|---|---|---|---|
| 1/19
No Class |
1/21
Lec 01: Course Introduction Slides |
1/23
Lec 02: Java Refresher Slides Sample Code |
No Recitation AI Quiz assigned, due 2/1/26 @ 11:59PM [autolab] PA0 assigned, due 2/1/26 @ 11:59PM [handout | submission] |
| 1/26
Lec 03: Math Refresher Slides |
1/28
Lec 04: ADTs and Data Structures Slides |
1/30
Lec 05: Intro to Complexity Slides Sample Code |
Recitation Week 1: Math/LinkedList Refresher [slides] WA1 assigned, due 2/1/26 @ 11:59PM [handout | submission] |
| 2/2
Lec 06: Asymptotic Analysis Slides |
2/4
Lec 07: Proving Bounds Slides |
2/6
Lec 08: Runtime Analysis in Code Slides |
Recitation Week 2: Asymptotic Analysis/PA1 [slides] PA1 assigned, testing due 2/8/26 @ 11:59PM [handout | submission] |
| 2/9
Lec 09: List ADT and LinkedLists Slides |
2/11
Lec 10: ArrayList and Amortized Runtime Slides |
2/13
Lec 11: Amortized Runtime Slides |
Recitation Week 3: Code Analysis [slides] PA1 implementation due 2/15/26 @ 11:59PM [handout | submission] |
| 2/16
Lec 12: Set ADT Slides |
2/18
Lec 13: Stacks and Queues Slides |
2/20
Lec 14: Stacks and Queues Slides |
Recitation Week 4: Amortized Analysis and Collection ADTs WA2 assigned, due 2/22/26 @ 11:59PM [handout | submission] |
| 2/23
Lec 15: Midterm #1 Review Slides |
2/25
Midterm #1 |
2/27
Lec 16: Graph ADTs Slides |
No Recitation |
| 3/2
Lec 17: Graph ADTs Slides |
3/4
Lec 18: Graph Traversals Slides |
3/6
Lec 19: Graph Traversals Slides |
Recitation Week 5: Graphs |
| 3/9
Lec 20: Priority Queue ADT Slides |
3/11
Lec 21: Heaps Slides |
3/13
Lec 22: Djikstra's Revisited Slides |
Recitation Week 6: Traversals |
| 3/16 - 3/20
Spring Break No Class |
No Recitation | ||
| 3/23
Lec 23: Recursion/Induction Slides |
3/25
Lec 24: Divide and Conquer Slides |
3/27
Lec 25: Binary Search Trees Slides |
Recitation Week 7: Induction |
| 3/30
Lec 26: Induction with Trees Slides |
4/1
Lec 27: Tree Traversals and Rotations Slides |
4/3
Lec 28: Balanced Trees (AVL) Slides |
Recitation Week 8: Heaps/BSTs |
| 4/6
Lec 29: Balanced Trees (Red-Black) Slides |
4/8
Lec 30: Midterm #2 Review Slides |
4/10
Midterm #2 |
No Recitations |
| 4/13
Lec 31: Expected Runtime Slides |
4/15
Lec 32: Intro to Hash Functions Slides |
4/17
Lec 33: Hash Tables Slides |
Recitation Week 9: Expected Runtime/Hash Tables |
| 4/20
Lec 34: Hash Table Variants Slides |
4/22
Lec 35: Hash Table Uses Slides |
4/24
Lec 36: The Memory Hierarchy Slides |
Recitation Week 10: Hash Tables |
| 4/27
Lec 37: B+ Trees Slides |
4/29
Lec 38: Bloom Filters Slides |
5/1
Lec 39: Recap and Review Slides |
Recitation Week 11: Review |
| 5/4
Lec 40: Recap and Review Slides |
5/6 - 5/14
Final Exam Period No Class CSE 250 Final 5/7 @ 3:30PM, Norton 190 |
No Recitation | |