| Monday | Wednesday | Friday |
|---|---|---|
| 1/9 | 1/11 First Day of Class Overview, Java, Computer Science, Tradeoffs | 1/13 Recitation Thinking about programming and efficiency. |
| 1/16 MLK, no class | 1/18 From arrays, to ArrayList, and towards Collections
| 1/20 Recitation |
| 1/23 Interfaces, Inheritance, Anagrams | 1/25 Linked structures Algorithmic and design efficiency code for APTs from class Drop/Add Over | 1/27 Recitation
|
| 1/30 Linked Questions
Anagram Part II out Read Chapter 3, 115-128
| 2/1 Recursion, lists Read Chapter 3, 96-111 | 2/3 Recitation
|
| 2/6 (matrices,recurrences) Read Chapter 4, 154-177 Model/View: MVC | 2/8 Catch up | 2/10 Recitation |
| 2/13 Review | 2/15 Test 1 | 2/17 Recitation |
| 2/20 Stacks, Queues, linear structures Read Chapter 5, 187-211
notes reading
| 2/22 ladder code from class From postfix to postorder: trees Read Chapter 7, 265-281
| 2/24 Midterm Grades Due Read Chapter 7, 282-308 |
| 2/27 Trees, Tries, Maps Read Chapter 9, 367-371
| 3/1 Searching, Search Trees
Read Chapter 9, 389-397
| 3/3 Recitation |
| 3/6 Hashing Read Chapter 9, 371-389 | 3/8 Catch up | 3/10 Recitation |
| 3/13 Spring Break | 3/15 Spring Break | 3/17 Spring Break |
| 3/20 Priority Queues, Heaps | 3/22 Huffman Coding | 3/24 |
| 3/27 Huff continued | 3/29 Sorting, Searching Backtracking
| 3/31 namesort apt namesort solutions test2 practice |
| 4/3 Review test2practice answers | 4/5 Test 2 | 4/7 Recitation |
| 4/10 Graphs: terminology and algorithms | 4/12 From MST to Shortest Path | 4/14 Recitation graph code |
| 4/17 Graphs continued, Memo-izing
bst code | 4/19 Bits, Representation, Bruteforce | 4/21 recitation/bit questions |
| 4/24 Big problems, big data, big ideas | 4/26 Last Day of Class | 4/28 |
| Monday | Tuesday | Wednesday | Thursday | Friday |
|---|---|---|---|---|
| 5/1 | 5/2 | 5/3 | 5/4 Final Exam 7:00-10:00 PM | 5/5 |